proven
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Theorem
Every Halin graph is planar.
Lean source view on GitHub
| 1 | import Lax68.HalinGraphs |
| 2 | import Lax68.Planar |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Halin graphs are planar |
| 7 | type: theorem |
| 8 | --- |
| 9 | Every Halin graph is planar. |
| 10 | -/ |
| 11 | |
| 12 | set_option autoImplicit false |
| 13 | |
| 14 | namespace Lax68.HalinPlanar |
| 15 | |
| 16 | axiom halin_planar |
| 17 | {V : Type*} {G : SimpleGraph V} : |
| 18 | Lax68.HalinGraphs.IsHalin G → |
| 19 | Lax68.Planar.IsPlanar G |
| 20 | |
| 21 | end Lax68.HalinPlanar |
| 22 |
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