Journal article
A logarithmic bound for the chromatic number of the associahedron
- Abstract:
- We show that the chromatic number of the $n$-dimensional associahedron grows at most logarithmically with $n$, improving a bound from and proving a conjecture of Fabila-Monroy et al. (2009).
- Publication status:
- Accepted
- Peer review status:
- Peer reviewed
Actions
Authors
- Publisher:
- Carleton University
- Journal:
- Journal of Computational Geometry More from this journal
- Acceptance date:
- 2026-05-23
- EISSN:
-
1920-180X
- Language:
-
English
- Pubs id:
-
1136536
- Local pid:
-
pubs:1136536
- Deposit date:
-
2026-05-27
- ARK identifier:
Terms of use
- Copyright date:
- 2018
- Notes:
- This article has been accepted for publication in Journal of Computational Geometry.
If you are the owner of this record, you can report an update to it here: Report update to this record