Graphs without a 3-Connected Subgraph are 4-Colourable
No public endorsements yet.
Loading review…
Sign in with ORCIDAbstract
This submission formalizes the main proof of Bonnet, Feghali, Nguyen, Scott, Seymour, Thomassé, and Trotignon available at https://arxiv.org/abs/2402.06338. It internally proves the technical Theorem 3. Only its consequence, Theorem 2, and the result claimed in the title are exposed.
Concepts
Review progress
- def
Lax10.Fragile - thm✓
Lax10.FragileFourColorable - thm✓
Lax10.Theorem2 - def
Lax10.ThreeConnectedAndColorable
thm✓proven claimdefdefinition
Concept map
Proofs
Proof networkview on GitHub
-
no assumptions
thm✓Lax10.Theorem2
Lean sources for these proofs: proofs/ on GitHub
Proof code is not displayed; the archive records each proof's checked relationship between claims.
Related submissions
No other submission in the archive builds on this one, and this one builds on none.
Cite this
@misc{lax-10,
author = {Édouard Bonnet},
title = {Graphs without a 3-Connected Subgraph are 4-Colourable},
year = {2026},
howpublished = {Lax Archive, lax-10},
url = {https://laxarchive.org/lax-10/},
note = {draft},
}
References
- Edouard Bonnet, Carl Feghali, Tung Nguyen, Alex Scott, Paul Seymour, Stephan Thomasse and Nicolas Trotignon. Graphs without a 3-Connected Subgraph are 4-Colourable. Electronic Journal of Combinatorics 32(1):P1.26, 2025. doi:10.37236/13181
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments