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

@misc{oum2026doublelogarithmic,
  title = {{A double-logarithmic upper bound on the chromatic number of the associahedron}},
  author = {Sang-il Oum and David R. Wood},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.39015},
  eprint = {2609.39015},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.39015},
}

TY  - UNPB
TI  - A double-logarithmic upper bound on the chromatic number of the associahedron
AU  - Sang-il Oum
AU  - David R. Wood
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.39015
UR  - https://arxiv.org/abs/2609.39015
AB  - We show that the associahedron 𝒜_n has chromatic number O(loglog n), improving on the previously best known upper bound of O(log n).
ER  -