Theorems · Theorem · combinatorics
SimpleGraph.minDegree_of_isEmpty
Deprecated since 2026-06-15Use SimpleGraph.minDegree_of_subsingleton instead.
∀ {V : Type u_1} (G : SimpleGraph V) [inst : Fintype V] [inst_1 : DecidableRel G.Adj] [Subsingleton V], G.minDegree = 0Alias of SimpleGraph.minDegree_of_subsingleton.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, 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.
- Fintypestatement · cited by 7,736
- SimpleGraphstatement · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.minDegreestatement · cited by 25
- SimpleGraph.minDegree_of_subsingletonproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.