Abstract
Let Qn be the poset that consists of all subsets of a fixed n-element set, ordered by set inclusion. The poset cube Ramsey number R(Qn,Qn) is defined as the least m such that any 2-coloring of the elements of Qm admits a monochromatic copy of Qn. The trivial lower bound R(Qn,Qn) ≥ 2n was improved by Cox and Stolee, who showed R(Qn,Qn) ≥ 2n + 1 for 3 ≤ n ≤ 8 and n ≥ 13 using a probabilistic existence proof. In this paper, we provide an explicit construction that establishes R(Qn,Qn) ≥ 2n + 1 for all n ≥ 3. The best known upper bound, due to Lu and Thompson, is R(Qn,Qn) ≤ n2 − 2n + 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability
All data generated or analyzed during this study are included in this published article
References
Axenovich, M., Manske, J., Martin, R.: Q2-free families in the Boolean lattice. Order 29(1), 177–191 (2012)
Axenovich, M., Walzer, S.: Boolean lattices: Ramsey properties and embeddings. Order 34(2), 287–298 (2017)
Cox, C., Stolee, D.: Ramsey numbers for partially-ordered sets. Order 35(3), 557–579 (2018)
Falgas-Ravry, V., Markström, K., Treglown, A., Yi, Z.: Existence thresholds and Ramsey properties of random posets. Random Struct. Algorithms 57 (4), 1097–1133 (2020)
Grósz, D., Methuku, A., Tompkins, C.: An upper bound on the size of diamond-free families of sets. J. Combin Theory Ser. A 156, 164–194 (2018)
Grósz, D., Methuku, A., Thompkins, C: Ramsey numbers of boolean lattices. arXiv:2104.02002 (2021)
Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey theory, vol. 20. Wiley, New York (1990)
Lu, L., Thompson, J.C.: Poset Ramsey numbers for Boolean lattices. Order 39, 171–185 (2022)
Suk, A.: On the Erdős-Szekeres convex polygon problem. J. Amer. Math. Soc. 30(4), 1047–1053 (2017)
Acknowledgements
We thank the anonymous referees for helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work was supported by a grant from the Simons Foundation (587088, TB)
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Bohman, T., Peng, F. A Construction for Boolean Cube Ramsey Numbers. Order 40, 327–333 (2023). https://doi.org/10.1007/s11083-022-09613-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-022-09613-7