Theorems · Theorem · combinatorics
SimpleGraph.IsRegularOfDegree.of_isEmpty
∀ {V : Type u_1} {G : SimpleGraph V} [inst : G.LocallyFinite] [IsEmpty V] {d : ℕ}, G.IsRegularOfDegree dThe empty graph is regular of any degree d
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 31 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- IsEmptystatement and proof · cited by 759
- IsEmpty.elimproof · cited by 46
- SimpleGraph.LocallyFinitestatement and proof · cited by 18
- SimpleGraph.IsRegularOfDegreestatement · cited by 10
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.