A logarithmic bound for the chromatic number of the associahedron

Alex Scott; Bruce Reed; David R. Wood; Louigi Addario Berry

A logarithmic bound for the chromatic number of the associahedron

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1811.08972 v2 pith:EZUQZIG5 submitted 2018-11-21 math.CO

Louigi Addario Berry , Bruce Reed , Alex Scott , David R. Wood This is my paper · ORCID

classification math.CO

keywords associahedronboundchromaticnumberconjecturedimensionalfabila-monroygrows

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

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

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Flip-graphs of non-orientable filling surfaces
math.GT 2025-05 accept novelty 6.0 of 10

The diameter of modular flip-graphs for non-orientable filling surfaces lies between 5n/2 and 4n asymptotically, and equals 5n/2 for the Möbius strip.

Pith tools