Abstract
A subposet Q ′ of a poset Q is a copy of a poset P if there is a bijection f between elements of P and Q ′ such that x ≤ y in P iff f(x) ≤ f(y) in Q. For posets P, P ′, let the poset Ramsey number R(P, P ′) be the smallest N such that no matter how the elements of the Boolean lattice Q N are colored red and blue, there is a copy of P with all red elements or a copy of P ′ with all blue elements. We provide some general bounds on R(P, P ′) and focus on the situation when P and P ′ are both Boolean lattices. In addition, we give asymptotically tight bounds for the number of copies of Q n in Q N and for a multicolor version of a poset Ramsey number.
Similar content being viewed by others
References
Axenovich, M., Gyárfás, A., Liu, H., Mubayi, D.: Multicolor Ramsey numbers for triple systems. In: Discrete Math, vol. 322, pp. 69–77 (2014), doi:10.1016/j.disc.2014.01.004
Brown, T.C., Erdős, P., Chung, F.R.K., Graham, R.L.: Quantitative forms of a theorem of Hilbert. In: J. Combin. Theory Ser. A, vol. 38.2, pp. 210–216 (1985), doi:10.1016/0097-3165(85)90071-8
Conlon, D., Fox, J., Sudakov, B.: An improved bound for the stepping-up lemma. In: Discrete Appl. Math., vol. 161.9, pp. 1191–1196 (2013), doi:10.1016/j.dam.2010.10.013
Conlon, D., Fox, J., Sudakov, B.: Hypergraph Ramsey numbers. In: Journal of the American Mathematical Society, vol. 23.1, pp. 247–247 (2010), doi:10.1090/s0894-0347-09-00645-6
Conlon, D., Fox, J., Sudakov, B.: Ramsey numbers of sparse hypergraphs. In: Random Structures Algorithms, vol. 35.1, pp. 1–14 (2009),doi: 10.1002/rsa.20260
Cooley, O., Fountoulakis, N., Kühn, D., Osthus, D.: Embeddings and Ramsey numbers of sparse k-uniform hypergraphs. In: Combinatorica, vol. 29.3, pp. 263–297 (2009), doi:10.1007/s00493-009-2356-y
Gunderson, D.S., Rödl, V., Sidorenko, A.: Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs, vol. 88.2, pp. 342–367 (1999), doi:10.1006/jcta.1999.2973
Hilbert, D.: Ueber die Irreducibilität ganzer rationaler Functionen mit ganzzahligen Coefficienten. In: J. Reine Angew. Math., vol. 110, pp. 104–129 (1892), doi:10.1515/crll.1892.110.104
Kierstead, H., Trotter, W.T.: A Ramsey theoretic problem for finite ordered sets. In: Discrete Mathematics, vol. 63.2-3, pp. 217–223 (1987), doi:10.1016/0012-365x(87)90009-4
Kleitman, D., Markowsky, G.: On Dedekind’s problem: the number of isotone Boolean functions. In: Trans. Amer. Math. Soc., vol. 213, pp. 373–390 (1975)
Kostochka, A., Mubayi, D., Verstraete, J.: Hypergraph Ramsey numbers: triangles versus cliques. In: J. Combin. Theory Ser. A, vol. 120.7, pp. 1491–1507 (2013), doi:10.1016/j.jcta.2013.04.009
van Lint, J.H., Wilson, R.M.: A course in combinatorics. 2nd, p xiv+602. Cambridge University Press, Cambridge (2001)
Methuku, A., Pálvölgyi, D.: Forbidden hypermatrices imply general bounds on induced forbidden subposet problems. In: ArXiv e-prints. arXiv:hep-th/1408.4093[math.CO] (2014)
Méroueh, A.: Lubell mass and induced partially ordered sets. In: ArXiv e-prints (2015 ). arXiv:hep-th/1506.07056 (2015 )
Nešetřil, J., Rödl, V.: Combinatorial partitions of finite posets and lattices - Ramsey lattices. In: Algebra Universalis, vol. 19.1, pp. 106–119 (1984), doi:10.1007/BF01191498
Paoli, M., Trotter, W.T., Walker, J.W.: Graphs and orders in Ramsey theory and in dimension theory. In: Graphs and order. Vol. 147. NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. Reidel, Dordrecht, pp. 351–394 (1985)
Patkos, B.: Induced and non-induced forbidden subposet problems. In: arXiv:hep-th/1408.0899[hep-th] (2015)
Ramsey, F.P.: On a Problem of Formal Logic. In: Proceedings of the London Mathematical Society s2-30.1, pp. 264–286 (1930), doi:10.1112/plms/s2-30.1.264
Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Baltimore: Johns Hopkins University Press (1992)
Trotter, W.T.: Embedding finite posets in cubes. In: Discrete Mathematics, vol. 12.2, pp. 165–172 (1975), doi:10.1016/0012-365X(75)90031-X
Trotter, W.T.: Ramsey theory and partially ordered sets. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, pp. 337–348 (1999)
Walzer, S.: Ramsey Variant of the 2-Dimension of Posets. In: Master Thesis (2015)
West, D.B.: Introduction to Graph Theory. 2nd ed. Prentice Hall, Sept (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Axenovich, M., Walzer, S. Boolean Lattices: Ramsey Properties and Embeddings. Order 34, 287–298 (2017). https://doi.org/10.1007/s11083-016-9399-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-016-9399-7