introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.9 kB
import Mathlib
namespace OAI
namespace Barnette
universe u
/-- A topological plane drawing of a simple graph, with no crossings. -/
structure PlaneEmbedding {V : Type u} (G : SimpleGraph V) where
point : V β†’ ℝ Γ— ℝ
point_injective : Function.Injective point
arc : βˆ€ (v w : V), G.Adj v w β†’ Path (point v) (point w)
arc_injective : βˆ€ (v w : V) (h : G.Adj v w),
Function.Injective (arc v w h)
arc_reverse : βˆ€ (v w : V) (h : G.Adj v w),
arc w v h.symm = (arc v w h).symm
arc_avoids_vertices : βˆ€ (v w : V) (h : G.Adj v w)
(t : unitInterval) (z : V),
arc v w h t = point z β†’
(t = 0 ∧ z = v) ∨ (t = 1 ∧ z = w)
interiors_disjoint : βˆ€ (v w x y : V) (h : G.Adj v w) (k : G.Adj x y)
(t s : unitInterval),
t β‰  0 β†’ t β‰  1 β†’ s β‰  0 β†’ s β‰  1 β†’
arc v w h t = arc x y k s β†’
(v = x ∧ w = y) ∨ (v = y ∧ w = x)
/-- Planarity means existence of a crossing-free topological plane embedding. -/
def Planar {V : Type u} (G : SimpleGraph V) : Prop :=
Nonempty (PlaneEmbedding G)
/-- Deleting any set of at most two vertices leaves a connected graph of order at least two. -/
def ThreeVertexConnected {V : Type u} [Fintype V] (G : SimpleGraph V) : Prop :=
4 ≀ Fintype.card V ∧
βˆ€ S : Finset V, S.card ≀ 2 β†’ (G.induce {v | v βˆ‰ S}).Connected
/-- A single spanning cycle, not a possibly disconnected spanning 2-factor. -/
def HasHamiltonianCycle {V : Type u} [DecidableEq V] (G : SimpleGraph V) : Prop :=
βˆƒ v : V, βˆƒ p : G.Walk v v, p.IsHamiltonianCycle
/-- Cubic bipartite three-vertex-connected plane graphs have a Hamiltonian cycle. -/
def MainStatement : Prop :=
βˆ€ (V : Type u) [Fintype V] [DecidableEq V] (G : SimpleGraph V)
[DecidableRel G.Adj],
G.IsRegularOfDegree 3 β†’ G.IsBipartite β†’ Planar G β†’
ThreeVertexConnected G β†’ HasHamiltonianCycle G
end Barnette
end OAI