AFTD Auto-Formalizing Theoretical Domains

graph_matching_num

def

The matching number of a graph G is the supremum of the cardinalities of the edge sets of all matchings in G.

Statement

noncomputable def graph_matching_num {V : Type*} (G : SimpleGraph V) : ℕ∞
Defined in
standard textbook definition (graph theory: matching number)
Verified
06 Oct 2026
Axioms
none listed
Used by 13

Lean source view module on GitHub

/-- The matching number of a graph, defined as the supremum of cardinalities of edge sets of matchings in G. -/
noncomputable def graph_matching_num {V : Type*} (G : SimpleGraph V) : ℕ∞ := ⨆ (M : SimpleGraph.Subgraph G) (_ : M.IsMatching), M.edgeSet.encard
See it in the graphDiscuss this resultChallenge it