Preprint
A double-logarithmic upper bound on the chromatic number of the associahedron
Mathematics
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)$.