Rainbow Ramsey Problems for the Boolean Lattice

/ Authors

Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li, Abhishek Methuku, Dániel T. Nagy, Bal'azs Patk'os, Máté Vizer

/ 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.

Journal: Order

DOI: 10.1007/s11083-021-09581-4