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