A logarithmic bound for the chromatic number of the associahedron

MaRDI QIDQ6310064zbMATH OpenFDO

Authors Louigi Addario-Berry, Bruce Reed, Alex Scott, David R. Wood

Publication date 21 November 2018

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

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).

This page was built for publication: A logarithmic bound for the chromatic number of the associahedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6310064)