Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.IsMatching.even_card
∀ {V : Type u_1} {G : SimpleGraph V} {M : G.Subgraph} [inst : Fintype ↑M.verts],
M.IsMatching → Even M.verts.toFinset.card- Cited by
- 5 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- mul_oneproof · cited by 3,885
- Finset.univproof · cited by 3,473
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardstatement and proof · cited by 2,327
- Finset.sum_congrproof · cited by 2,323
- Evenstatement · cited by 444
- Set.ncardproof · cited by 344
- SimpleGraph.Subgraphstatement and proof · cited by 326
- Finset.sum_constproof · cited by 254
- two_mulproof · cited by 232
Cited by5
Results whose statement or proof uses this declaration.
- SimpleGraph.ConnectedComponent.odd_matches_node_outsideproof · cited by 1
- SimpleGraph.Subgraph.IsPerfectMatching.exists_of_isClique_suppproof · cited by 1
- SimpleGraph.IsClique.even_iff_exists_isMatchingproof · cited by 1
- SimpleGraph.Subgraph.IsPerfectMatching.even_cardproof · cited by 0
- SimpleGraph.ConnectedComponent.even_card_of_isPerfectMatchingproof · cited by 0