A double-logarithmic upper bound on the chromatic number of the associahedron

Abstract

We show that the associahedron ${\mathcal{A}}_n$ has chromatic number $O(\log \log n)$, improving on the previously best known upper bound of $O(\log n)$.

arXiv comment13 pages, 6 figure. Ancillary files include verification codes for the chromatic number of ${\mathcal{A}}_{15}$