Rainbow Ramsey problems for the Boolean lattice
Combinatorics
2020-07-17 v2
Abstract
We address the following rainbow Ramsey problem: For posets what is the smallest number such that any coloring of the elements of the Boolean lattice either admits a monochromatic copy of or a rainbow copy of . We consider both weak and strong (non-induced and induced) versions of this problem. We also investigate related problems on (partial) -colorings of that do not admit rainbow antichains of size .
Cite
@article{arxiv.1809.08629,
title = {Rainbow Ramsey problems for the Boolean lattice},
author = {Fei-Huang Chang and Dániel Gerbner and Wei-Tian Li and Abhishek Methuku and Dániel Nagy and Balázs Patkós and Máté Vizer},
journal= {arXiv preprint arXiv:1809.08629},
year = {2020}
}