Paths are planar
Lax68.PathPlanar · concepts/Lax68/PathPlanar.lean · lax-68
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Every path graph is planar.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax68.Paths |
| 2 | import Lax68.Planar |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Paths are planar |
| 7 | type: theorem |
| 8 | --- |
| 9 | Every path graph is planar. |
| 10 | -/ |
| 11 | |
| 12 | set_option autoImplicit false |
| 13 | |
| 14 | namespace Lax68.PathPlanar |
| 15 | |
| 16 | /-- Every path graph is planar. -/ |
| 17 | axiom path_planar {V : Type*} {G : SimpleGraph V} : |
| 18 | Lax68.Paths.IsPath G → |
| 19 | Lax68.Planar.IsPlanar G |
| 20 | |
| 21 | end Lax68.PathPlanar |
| 22 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments