Theorems · Theorem · combinatorics
SimpleGraph.IsRegularOfDegree.minDegree_eq
∀ {V : Type u_1} (G : SimpleGraph V) [inst : Fintype V] [Nonempty V] [inst_2 : DecidableRel G.Adj] {d : ℕ},
G.IsRegularOfDegree d → G.minDegree = d- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeNonemptyDecidableRel
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- Finset.imageproof · cited by 910
- SimpleGraph.neighborSetstatement · cited by 257
- Finset.minproof · cited by 36
- WithTop.untopDproof · cited by 33
- SimpleGraph.minDegreestatement · cited by 25
- SimpleGraph.IsRegularOfDegreestatement and proof · cited by 10
- Finset.image_constproof · cited by 5
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.minDegree_topproof · cited by 0