Theorems · Theorem · combinatorics

SimpleGraph.Subgraph.IsMatching.exists_of_universalVerts

∀ {V : Type u_1} {G : SimpleGraph V} [Finite V] {s : Set V},
  Disjoint G.universalVerts s →
    s.ncard ≤ G.universalVerts.ncard → ∃ t ⊆ G.universalVerts, ∃ M, M.verts = s ∪ t ∧ M.IsMatching

Defined in

Mathlib.Combinatorics.SimpleGraph.UniversalVerts

Cited by

0 results in Mathlib

Foundations

Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

Finite