Maximum matching number
Lax825442.MaximumMatching · concepts/Lax825442/MaximumMatching.lean · lax-825442
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
The maximum matching number of a graph is the largest number of edges in a matching. The empty graph has maximum matching number zero.
Concept map
Lean source view on GitHub
| 1 | import Mathlib.Combinatorics.SimpleGraph.Matching |
| 2 | import Mathlib.Order.Lattice.Nat |
| 3 | import Mathlib.Data.Set.Card |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Maximum matching number |
| 8 | type: definition |
| 9 | --- |
| 10 | The maximum matching number of a graph is the largest number of edges in a |
| 11 | matching. The empty graph has maximum matching number zero. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax825442.MaximumMatching |
| 15 | |
| 16 | /-- The maximum number of edges in a matching. -/ |
| 17 | noncomputable def maximumMatching {V : Type} [Fintype V] [DecidableEq V] |
| 18 | (G : SimpleGraph V) : ℕ := |
| 19 | sSup {n : ℕ | ∃ M : G.Subgraph, M.IsMatching ∧ (M.edgeSet.ncard = n)} |
| 20 | |
| 21 | end Lax825442.MaximumMatching |
| 22 |
Builds on
none
Used by
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments