Indexed metadata

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

Sang-il Oum, David R. Wood

Source record

Source: arXiv

Published: Sep 30, 2026

arXiv: 2609.39015

Open original source ↗

Source abstract

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

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.