open
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Theorem
Every path graph is planar.
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 | axiom path_planar {V : Type*} {G : SimpleGraph V} : |
| 17 | Lax68.Paths.IsPath G → |
| 18 | Lax68.Planar.IsPlanar G |
| 19 | |
| 20 | end Lax68.PathPlanar |
| 21 |
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