Theorems · Theorem · combinatorics
SimpleGraph.minDegree_le_maxDegree
∀ {V : Type u_1} (G : SimpleGraph V) [inst : Fintype V] [inst_1 : DecidableRel G.Adj], G.minDegree ≤ G.maxDegree- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableRel
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- LE.le.transproof · cited by 3,151
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- IsEmptyproof · cited by 759
- SimpleGraph.minDegreestatement · cited by 25
- SimpleGraph.maxDegreestatement · cited by 19
- SimpleGraph.minDegree_le_degreeproof · cited by 6
- SimpleGraph.minDegree_of_subsingletonproof · cited by 6
- SimpleGraph.maxDegree_of_subsingletonproof · cited by 5
- SimpleGraph.degree_le_maxDegreeproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.minDegree_bot_eq_zeroproof · cited by 1