Prefer a chat interface with context about you and your work?
Rainbow Ramsey Problems for the Boolean Lattice
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 B n either admits a monochromatic copy of P or a rainbow copy of Q . We consider both weak …