REVIEW
Not yet reviewed by Pith; the record is open.
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
A short proof of Brooks' theorem
classification
math.CO
keywords
coloringbrookstheoremproofshortargumentavoidingconnectivity
read the original abstract
We give a simple short proof of Brooks' theorem using only induction and greedy coloring, while avoiding issues of graph connectivity. The argument generalizes easily to some extensions of Brooks' theorem, including its variants for list coloring, signed graphs coloring and correspondence coloring.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.