2 papers
math.CO2025
The Global Structure of a Typical Graph Without as an Induced Subgraph when is a Cycle
Bruce Reed
One way to certify that a graph does not contain an induced cycle of length six is to provide a partition of its vertex set into (i) a stable set, and (ii) a graph containing no st…
math.CO2025
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…