Lax68.WagnerObstructionBridge
The Kuratowski-Wagner obstruction bridge
concepts/Lax68/WagnerObstructionBridge.lean · lax-68
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
No proof in the archive yet — this claim is open.
Theorem
A graph contains a subdivision of K₅ or K₃,₃ exactly when it contains K₅ or K₃,₃ as a minor. This special equivalence does not hold for arbitrary forbidden graphs.
Lean source view on GitHub
| 1 | import Lax68.GraphTopologicalMinors |
| 2 | import Lax68.Planar |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: The Kuratowski-Wagner obstruction bridge |
| 7 | type: theorem |
| 8 | --- |
| 9 | A graph contains a subdivision of *K₅* or *K₃,₃* exactly when it contains |
| 10 | *K₅* or *K₃,₃* as a minor. This special equivalence does not hold for |
| 11 | arbitrary forbidden graphs. |
| 12 | -/ |
| 13 | |
| 14 | set_option autoImplicit false |
| 15 | |
| 16 | namespace Lax68.WagnerObstructionBridge |
| 17 | |
| 18 | axiom kuratowskiFree_iff_excludedMinors |
| 19 | {V : Type*} {G : SimpleGraph V} : |
| 20 | Lax68.GraphTopologicalMinors.IsKuratowskiFree G ↔ |
| 21 | Lax68.Planar.IsPlanarByExcludedMinors G |
| 22 | |
| 23 | end Lax68.WagnerObstructionBridge |
| 24 |
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