Theorems · Theorem · combinatorics
SimpleGraph.IsRegularOfDegree.top
∀ {V : Type u_1} [inst : Fintype V] [inst_1 : DecidableEq V], ⊤.IsRegularOfDegree (Fintype.card V - 1)- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Top.topstatement · cited by 9,680
- Fintypestatement and proof · cited by 7,736
- SimpleGraphstatement · cited by 3,072
- Fintype.cardstatement and proof · cited by 1,386
- SimpleGraph.neighborSetstatement · cited by 257
- SimpleGraph.IsRegularOfDegreestatement · cited by 10
- SimpleGraph.complete_graph_degreeproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.minDegree_topproof · cited by 0
- SimpleGraph.maxDegree_topproof · cited by 0
- SimpleGraph.IsSRGWith.topproof · cited by 0