Theorems · Theorem · combinatorics
SimpleGraph.IsRegularOfDegree.bot
∀ {V : Type u_1} [inst : Fintype V], ⊥.IsRegularOfDegree 0- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- Bot.botstatement · cited by 4,720
- SimpleGraphstatement · cited by 3,072
- SimpleGraph.neighborSetstatement · cited by 257
- SimpleGraph.IsRegularOfDegreestatement · cited by 10
- SimpleGraph.bot_degreeproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.bot_strongly_regularproof · cited by 0