Abstract
We address the following rainbow Ramsey problem: For posets P, Q what is the smallest number n such that any coloring of the elements of the Boolean lattice Bn either admits a monochromatic copy of P or a rainbow copy of Q. We consider both weak and strong (non-induced and induced) versions of this problem.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Code Availability
Our manuscript contains no associated code.
References
Axenovich, M., Walzer, S.: Boolean lattices: Ramsey properties and embeddings. Order 34(2), 287–298 (2017)
Chen, H.-B., Cheng, Y.-J., Li, W.-T., Liu, C.-A.: The Boolean rainbow Ramsey number of antichains, Boolean Posets, and chains. Electron. J. Comb. 27, # P34 (2020)
Cox, C., Stolee, D.: Ramsey numbers for partially-ordered sets. Order 35, 557–579 (2018)
Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of Ramsey theory-a dynamic survey. Theory Appl Graphs (2014)
Griggs, J.R., Lu, L.: On families of subsets with a forbidden subposet. Comb. Probab. Comput. 18(5), 731–748 (2009)
Griggs, J.R., Li, W.-T., Lu, L.: Diamond-free families. J. Comb. Theory Ser. A 119(2), 310–322 (2012)
Griggs, J.R., Li, W.-T.: The partition method for poset-free families. J. Comb. Optim. 25(4), 587–596 (2013)
Griggs, J.R., Li, W.-T.: Poset-free families and Lubell-boundedness. J. Comb. Theory Ser. A 134, 166–157 (2015)
Grósz, D., Methuku, A., Tompkins, C.: An upper bound on the size of diamond-free families of sets. J. Comb. Theory Ser. A 156, 164–194 (2018)
Johnston, T., Lu, L., Milans, K.G.: Boolean algebras and Lubell functions. J. Comb. Theory Ser. A 136, 174–183 (2015)
Kierstead, H.A., Trotter, W.T.: A Ramsey theoretic problem for finite ordered sets. Discret. Math. 63(2-3), 217–223 (1987)
Lu, L., Thompson, J.C.: Poset ramsey number for Boolean lattices. arXiv:1909.08680 (2021)
Méroueh, A.: A LYM inequality for induced posets. J. Comb. Theory Ser. A 155, 398–417 (2018)
Patkós, B.: Induced and non-induced forbidden subposet problems. Electron. J. Comb. 22(1), P1.30 (2015)
Trotter, W.T.: Ramsey theory and partially ordered sets. In: Contemporary Trends in Discrete Mathmatics, Graham, RL, et al (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp 337–347 (1999)
Funding
Open access funding provided by ELKH Alfréd Rényi Institute of Mathematics. Research supported by the National Research, Development and Innovation Office - NKFIH under the grants K 116769, K 132696, KH 130371, SNN 129364, FK 132060, and KKP-133819, by the János Bolyai Research Fellowship of the Hungarian Academy of Sciences and the Taiwanese-Hungarian Mobility Program of the Hungarian Academy of Sciences, by Ministry of Science and Technology Project-based Personnel Exchange Program 107 -2911-I-005 -505 and by the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant no 075-15-2019-1926 and by the EPSRC grant no. EP/S00100X/1 (A. Methuku). Research of Vizer was supported by the New National Excellence Program under the grant number ÚNKP-20-5-BME-45.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interests
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Additional information
Availability of data and material
Our manuscript contains no associated data.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Chang, FH., Gerbner, D., Li, WT. et al. Rainbow Ramsey Problems for the Boolean Lattice. Order 39, 453–463 (2022). https://doi.org/10.1007/s11083-021-09581-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-021-09581-4