Download data/lean/OAI/Combinatorics/Hamiltonian/Model.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 1.9 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/Hamiltonian/Model.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/Hamiltonian/Model.lean
-
curl -L -o Model.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/Hamiltonian/Model.lean
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 | |