Theorems · Theorem · combinatorics
SimpleGraph.minDegree_of_subsingleton
∀ {V : Type u_1} (G : SimpleGraph V) [inst : Fintype V] [inst_1 : DecidableRel G.Adj] [Subsingleton V], G.minDegree = 0- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- 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
- IsEmptyproof · cited by 759
- isEmpty_or_nonemptyproof · cited by 269
- Finset.univ_eq_emptyproof · cited by 51
- Finset.minproof · cited by 36
- WithTop.untopDproof · cited by 33
- SimpleGraph.minDegreestatement · cited by 25
- SimpleGraph.IsIsolated.degree_eq_zeroproof · cited by 6
Cited by6
Results whose statement or proof uses this declaration.
- SimpleGraph.Copy.minDegree_monoproof · cited by 2
- SimpleGraph.minDegree_le_maxDegreeproof · cited by 1
- SimpleGraph.minDegree_le_minDegreeproof · cited by 1
- SimpleGraph.minDegree_of_isEmptyproof · cited by 0
- SimpleGraph.minDegree_topproof · cited by 0
- SimpleGraph.le_minDegree_induce_of_support_subsetproof · cited by 0