Definitions.lean`

2 declarations, 0 contain sorry, 0 declared as axioms

def OAI.HadwigerMatching.IsTouchingMatching line 12
Source documentation
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.
Also declared: ComparatorChallenges/HadwigerCounterexample.lean:10 (same declaration text).
```
def IsTouchingMatching (G : SimpleGraph V) (M : Finset (Finset V)) : Prop :=
…
```
def OAI.HadwigerMatching.connectedMatchingNumber line 20
Source documentation
The supremum of the cardinalities of pairwise touching matchings. For finite vertex types, this supremum is attained.
Also declared: ComparatorChallenges/HadwigerCounterexample.lean:16 (same declaration text).
```
noncomputable def connectedMatchingNumber (G : SimpleGraph V) : ℕ :=
…
```