Theorems · Theorem · combinatorics
SimpleGraph.odd_card_odd_degree_vertices_ne
∀ {V : Type u} (G : SimpleGraph V) [inst : Fintype V] [inst_1 : DecidableEq V] [inst_2 : DecidableRel G.Adj] (v : V),
Odd (G.degree v) → Odd {w | w ≠ v ∧ Odd (G.degree w)}.card- Cited by
- 1 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetproof · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Finset.univstatement and proof · cited by 3,473
- SimpleGraphstatement and proof · cited by 3,072
- Finset.cardstatement and proof · cited by 2,327
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Finset.Nonemptyproof · cited by 1,001
- Finset.filterstatement and proof · cited by 949
- Oddstatement and proof · cited by 364
- SimpleGraph.neighborSetstatement · cited by 257
- two_mulproof · cited by 232
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.exists_ne_odd_degree_of_exists_odd_degreeproof · cited by 0