Poset Ramsey Number R (P, Qₙ). II. N-Shaped Poset

Abstract Given partially ordered sets (posets) (P, P) (P, ≤ P) and (P', ₏') (P ′, ≤ P ′), we say that P' P ′ contains a copy of P if for some injective function f: P P' f: P → P ′ and for any A, B P A, B ∈ P, A P B A ≤ P B if and only if f (A) ₏' f (B) f (A) ≤ P ′ f (B). For any posets P and Q, the poset Ramsey number R (P, Q) is the least positive integer N such that no matter how the elements of an N -dimensional Boolean lattice are colored in blue and red, there is either a copy of P with all blue elements or a copy of Q with all red elements. We focus on the poset Ramsey number R (P, Qₙ) R (P, Q n) for a fixed poset P and an n -dimensional Boolean lattice Qₙ Q n, as n grows large. It is known that n+c₁ (P) R (P, Qₙ) c₂ (P) n n + c 1 (P) ≤ R (P, Q n) ≤ c 2 (P) n, for positive constants c₁ c 1 and c₂ c 2. However, there is no poset P known, for which R (P, Qₙ) > (1+) n R (P, Q n) > (1 + ϵ) n, for >0 ϵ > 0. This paper is devoted to a new method for finding upper bounds on R (P, Qₙ) R (P, Q n) using a duality between copies of Qₙ Q n and sets of elements that cover them, referred to as blockers. We prove several properties of blockers and their direct relation to the Ramsey numbers. Using these properties we show that R (N, Qₙ) =n+ (n/ n) R (N, Q n) = n + Θ (n / log n), for a poset N N with four elements A, B, C, and D, such that A A C, B B D, B B C, and the remaining pairs of elements are incomparable.