Download data/lean/OAI/Combinatorics/HadwigerMatching/Definitions.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 868 Bytes
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/HadwigerMatching/Definitions.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/HadwigerMatching/Definitions.lean
-
curl -L -o Definitions.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/HadwigerMatching/Definitions.lean
868 Bytes
| import Mathlib.Combinatorics.SimpleGraph.Clique | |
| namespace OAI | |
| namespace HadwigerMatching | |
| universe u | |
| variable {V : Type u} | |
| /-- A finite matching whose edges are pairwise touching: each member is a | |
| two-vertex clique, and distinct members are disjoint and joined by an edge. -/ | |
| def IsTouchingMatching (G : SimpleGraph V) (M : Finset (Finset V)) : Prop := | |
| (β e β M, e.card = 2 β§ G.IsClique (e : Set V)) β§ | |
| (β e β M, β f β M, e β f β Disjoint e f) β§ | |
| (β e β M, β f β M, e β f β | |
| β v β e, β w β f, G.Adj v w) | |
| /-- The supremum of the cardinalities of pairwise touching matchings. | |
| For finite vertex types, this supremum is attained. -/ | |
| noncomputable def connectedMatchingNumber (G : SimpleGraph V) : β := | |
| sSup {n : β | β M : Finset (Finset V), IsTouchingMatching G M β§ M.card = n} | |
| end HadwigerMatching | |
| end OAI | |