File size: 868 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
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