Multicolor list Ramsey numbers grow exponentially
Abstract
The list Ramsey number R(H,k), recently introduced by Alon, Buci\'c, Kalvari, Kuperwasser, and Szab\'o, is a list-coloring variant of the classical Ramsey number. They showed that if H is a fixed r-uniform hypergraph that is not r-partite and the number of colors k goes to infinity, e(k) R (H,k) eO(k). We prove that R(H,k) = e(k) if and only if H is not r-partite.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.