Plane Drawing Dart Arc Data Exists
ProvedPlaneDrawingDartArcDataExistscrossing-consequencestrellis-port
Let be a finite simple graph and let be a crossing-free ordinary
polygonal drawing of . Then admits oriented dart-arc data in the
sense of PlaneDrawingDartArcData.
Formalization Note This node is ported from the Trellis formalization of the crossing lemma and its consequences (wpegden/crossing-consequences, commit 8769d142, W. Pegden, Apache-2.0); the statement is the Trellis node PlaneDrawingDartArcDataExists.
Preamble
import Mathlib.Analysis.InnerProductSpace.PiL2 import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Combinatorics.SimpleGraph.Finite import Mathlib.Data.Finset.Prod import Mathlib.Data.Set.Finite.Basic import Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Basic import Mathlib.Combinatorics.SimpleGraph.DegreeSum import Definitions.Def_OrdinaryPolygonalDrawing import Definitions.Def_PlaneDrawingDartArcData open Classical noncomputable section
Formal statement
lemma PlaneDrawingDartArcDataExists {V : Type*} [Fintype V]
(G : SimpleGraph V) [Fintype G.edgeSet] [DecidableRel G.Adj]
(D : OrdinaryPolygonalDrawing G) (hD : D.crossingSet.card = 0) :
Nonempty (PlaneDrawingDartArcData G D) := by sorrySource