The excluded-minor characterization of outerplanarity
Lax68.OuterplanarExcludedMinors · concepts/Lax68/OuterplanarExcludedMinors.lean · lax-68
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Opn
For every finite simple graph, having an outerplane drawing is equivalent to containing neither K₄ nor K₂,₃ as a minor.
This is the standard excluded-minor characterization of outerplanar graphs. It is an open theorem in this submission.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax68.Outerplanar |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The excluded-minor characterization of outerplanarity |
| 6 | type: opn |
| 7 | --- |
| 8 | For every finite simple graph, having an outerplane drawing is equivalent to |
| 9 | containing neither *K₄* nor *K₂,₃* as a minor. |
| 10 | |
| 11 | This is the standard excluded-minor characterization of outerplanar graphs. |
| 12 | It is an open theorem in this submission. |
| 13 | -/ |
| 14 | |
| 15 | set_option autoImplicit false |
| 16 | |
| 17 | namespace Lax68.OuterplanarExcludedMinors |
| 18 | |
| 19 | /-- A finite graph is outerplanar exactly when it has neither `K₄` nor `K₂,₃` |
| 20 | as a minor. This remains open in the present formalization. -/ |
| 21 | axiom outerplanar_iff_excludedMinors |
| 22 | {V : Type*} {G : SimpleGraph V} : |
| 23 | Finite V → |
| 24 | (Lax68.Outerplanar.IsOuterplanar G ↔ |
| 25 | Lax68.Outerplanar.IsOuterplanarByExcludedMinors G) |
| 26 | |
| 27 | end Lax68.OuterplanarExcludedMinors |
| 28 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments