A construction for Boolean cube Ramsey numbers

DOI10.1007/S11083-022-09613-7arXiv2102.00317MaRDI QIDQ6171424

Fei Peng, Tom Bohman

Publication date: 18 July 2023

Published in: Order (Search for Journal in Brave)

Abstract: Let $Q_n$ be the poset that consists of all subsets of a fixed $n$-element set, ordered by set inclusion. The poset cube Ramsey number $R(Q_n,Q_n)$ is defined as the least $m$ such that any 2-coloring of the elements of $Q_m$ admits a monochromatic copy of $Q_n$. The trivial lower bound $R(Q_n,Q_n)ge 2n$ was improved by Cox and Stolee, who showed $R(Q_n,Q_n)ge 2n+1$ for $3le nle 8$ and $nge 13$ using a probabilistic existence proof. In this paper, we provide an explicit construction that establishes $R(Q_n,Q_n)ge 2n+1$ for all $nge 3$. The best known upper bound, due to Lu and Thompson, is $ R(Q_n, Q_n) le n^2 - 2n + 2$.

Full work available at URL: https://arxiv.org/abs/2102.00317

zbMATH Keywords

constructionposet Ramsey

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Cites Work

• Unnamed Item
• \(Q _{2}\)-free families in the Boolean lattice
• An upper bound on the size of diamond-free families of sets
• Ramsey numbers for partially-ordered sets
• Poset Ramsey numbers for Boolean lattices
• Boolean lattices: Ramsey properties and embeddings
• Existence thresholds and Ramsey properties of random posets
• On the Erdős-Szekeres convex polygon problem

Related Items (1)

Poset Ramsey numbers: large Boolean lattice versus a fixed poset

This page was built for publication: A construction for Boolean cube Ramsey numbers