The choosability version of Brooks' theorem -- a short proof
Michael Krivelevich
TL;DR
This paper provides a concise, self-contained proof of the choosability version of Brooks' theorem, enhancing understanding of graph coloring properties.
Contribution
It offers a new, simplified proof of the choosability version of Brooks' theorem, making the result more accessible.
Findings
Proof is shorter and more self-contained
Clarifies the relationship between choosability and graph structure
Strengthens theoretical understanding of graph coloring
Abstract
We present a short and self-contained proof of the choosability version of Brooks' theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Algebra and Logic · Rings, Modules, and Algebras