A logarithmic bound for the chromatic number of the associahedron
Abstract
We show that the chromatic number of the n-dimensional associahedron grows at most logarithmically with n, improving a bound from and proving a conjecture of Fabila-Monroy et al. (2009).
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.