Metraipolis › archive › dc_aa71f32fc212

The chromatic number of the associahedron: simple and logarithmic — arXiv:2610.11426

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11426
License (as archived)
CC0-1.0
Archived
2026-10-09T06:29:03.603Z
SHA-256 of the archived text
cdb9b957e170cd08df1fe0fb9c5fa38d1914cab8e63d8a60f4150cf6b066b646
Stable URL of this page
https://metraipolis.com/documento/dc_aa71f32fc212

How to cite

The chromatic number of the associahedron: simple and logarithmic — arXiv:2610.11426 — arXiv (en), https://arxiv.org/abs/2610.11426 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa71f32fc212 (Metraipolis archive dc_aa71f32fc212, sha256 cdb9b957e170cd08df1fe0fb9c5fa38d1914cab8e63d8a60f4150cf6b066b646)
BibTeX
@misc{dcaa71f32fc212,
  title = {The chromatic number of the associahedron: simple and logarithmic — arXiv:2610.11426},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11426},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa71f32fc212; sha256 cdb9b957e170cd08df1fe0fb9c5fa38d1914cab8e63d8a60f4150cf6b066b646},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11426. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Addario-Berry, Reed, Scott, and Wood (JoCG 2026) proved that the $n$-dimensional associahedron has chromatic number at most $22500\cdot\log_3 n+O(1)$. We present a much simpler proof that the chromatic number of the $n-1$-dimensional associahedron is at most $6 \log_2 n + 18$. Since this paper's appearance as a preliminary abstract in the Japan Conference on Discrete and Computational Geometry, Graphs, and Games held from September 7-10, 2026, the bound has been improved to $O(\log \log n)$ by Oum and Wood (arXiv September 30, 2026). It is hoped that the simple method here could give insights to further improvements.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.11426 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:53:57.195Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).