Theorems · Theorem · combinatorics
SimpleGraph.odd_ncard_oddComponents
∀ {V : Type u} (G : SimpleGraph V) [Finite V], Odd G.oddComponents.ncard ↔ Odd (Nat.card V)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Finite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites27
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SetLike.coeproof · cited by 8,199
- Fintypeproof · cited by 7,736
- Set.Elemproof · cited by 7,166
- Finset.sumproof · cited by 5,195
- Finset.univproof · cited by 3,473
- SimpleGraphstatement and proof · cited by 3,072
- Finitestatement and proof · cited by 3,029
- Set.iUnionproof · cited by 2,483
- Finset.cardproof · cited by 2,327
- Finset.sum_congrproof · cited by 2,323
- Finset.filterproof · cited by 949
- Nat.cardstatement · cited by 844
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.IsTutteViolator.emptyproof · cited by 1