3 citations · 3 across the 1 of their papers we have counts for
2 papers
math.CO2026
A double-logarithmic upper bound on the chromatic number of the associahedron
Sang-il Oum, David R. Wood
We show that the associahedron has chromatic number , improving on the previously best known upper bound of .
math.CO2018★ 3 cited
A logarithmic bound for the chromatic number of the associahedron
Louigi Addario Berry, Bruce Reed, Alex Scott +1
We show that the chromatic number of the -dimensional associahedron grows at most logarithmically with , improving a bound from and proving a conjecture of Fabila-Monroy et a…