definition
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Definition
A graph is planar when it can be drawn in the plane without crossings. For finite graphs, this is equivalent to containing neither the complete graph K₅ nor the complete bipartite graph K₃,₃ as a minor. The drawing certificate and graph-minor relation are supplied by separate concepts.
Lean source view on GitHub
| 1 | import Lax68.StraightLineDrawings |
| 2 | import Lax68.GraphMinors |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Planar graphs |
| 7 | type: definition |
| 8 | --- |
| 9 | A graph is planar when it can be drawn in the plane without crossings. |
| 10 | For finite graphs, this is equivalent to containing neither the complete graph |
| 11 | *K₅* nor the complete bipartite graph *K₃,₃* as a minor. The drawing certificate |
| 12 | and graph-minor relation are supplied by separate concepts. |
| 13 | -/ |
| 14 | |
| 15 | set_option autoImplicit false |
| 16 | |
| 17 | namespace Lax68.Planar |
| 18 | |
| 19 | open GraphMinors |
| 20 | |
| 21 | def IsPlanar {V : Type*} (G : SimpleGraph V) : Prop := |
| 22 | StraightLineDrawings.HasStraightLineDrawing G |
| 23 | |
| 24 | def IsPlanarByExcludedMinors {V : Type*} (G : SimpleGraph V) : Prop := |
| 25 | ¬IsMinor K5 G ∧ |
| 26 | ¬IsMinor K33 G |
| 27 | |
| 28 | end Lax68.Planar |
| 29 |
Used by
Lax68.GridPlanarLax68.HalinPlanarLax68.KuratowskiPlanarityLax68.LadderPlanarLax68.MaximalOuterplanarPlanarLax68.OuterplanarPlanarLax68.PathPlanarLax68.PlanarExcludedMinorsLax68.SeriesParallelPlanarLax68.StarPlanarLax68.TreePlanarLax68.TrianglePlanarLax68.TriangulationPlanarLax68.TriangulationsLax68.WagnerObstructionBridgeLax68.WallPlanarLax68.WheelPlanar
From Mathlib
none
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