Photo by ninjason from unsplash
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… Click to show full 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.
Keywords:
rainbow ramsey;
ramsey problems;
rainbow;
boolean lattice
Journal Title: Order
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Order
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!