Chang, Fei-Huang and Gerbner, Dániel and Li, Wei-Tian and Methuku, Abhishek and Nagy, Dániel and Patkós, Balázs and Vizer, Máté (2021) Rainbow Ramsey Problems for the Boolean Lattice. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS. ISSN 0167-8094
|
Text
s11083-021-09581-4.pdf Available under License Creative Commons Attribution. Download (300kB) | Preview |
Official URL: http://doi.org/10.1007/s11083-021-09581-4
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. We also investigate related problems on (partial) k-colorings of Bn that do not admit rainbow antichains of size k.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Sep 2022 08:26 |
| Last Modified: | 12 Sep 2022 08:26 |
| URI: | http://real.mtak.hu/id/eprint/148292 |
Actions (login required)
 |
Edit Item |
