Theorems · Theorem · combinatorics
SimpleGraph.IsRegularOfDegree.degree_eq
∀ {V : Type u_1} {G : SimpleGraph V} [inst : G.LocallyFinite] {d : ℕ}, G.IsRegularOfDegree d → ∀ (v : V), G.degree v = d- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 31 from the axioms · uses propext, Quot.sound
- Assumes
- SimpleGraph.LocallyFinite
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.degreestatement · cited by 112
- SimpleGraph.LocallyFinitestatement and proof · cited by 18
- SimpleGraph.IsRegularOfDegreestatement and proof · cited by 10
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.IsSRGWith.card_neighborFinset_union_eqproof · cited by 2
- SimpleGraph.IsRegularOfDegree.maxDegree_eqproof · cited by 1
- SimpleGraph.IsRegularOfDegree.minDegree_eqproof · cited by 1