arXiv (All)
open access
Greedy Coloring and Simple Exponential Strengthenings of Brooks-Type Theorems
Brooks' Theorem is a foundational result in graph coloring: if a graph is connected, not a clique, and has maximum degree $Δ\geq 3$, then it admits a proper $Δ$-coloring. In this paper, we give a new proof of a much stronger result: every such graph admits exponentially many proper $Δ$-colorings. Ex
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Brooks-like result for graph powers $#983875
- Non-isomorphic graphs have distinct vertex-Ramsey classes#1188415
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#924967
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#920733
Record · ID 1325270
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive