This record is currently in review state, the data hasn’t been validated yet.
- Journal Article
We introduce a list-coloring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each other. We find graph sequences where the two are equal and where they are far apart. For (Formula presented.) -uniform cliques we prove that the list Ramsey number is bounded by an exponential function, while it is well known that the Ramsey number is superexponential for uniformity at least 3. This is in great contrast to the graph case where we cannot even decide the question of equality for cliques. © 2020 Wiley Periodicals LLC. Show more
Journal / seriesJournal of Graph Theory
SubjectChromatic number; List coloring; Ramsey theory
175573 - Extremal problems in combinatorics (SNF)
MoreShow all metadata