Theorems · Theorem · combinatorics
SimpleGraph.bot_strongly_regular
∀ {V : Type u} [inst : Fintype V] {ℓ : ℕ}, ⊥.IsSRGWith (Fintype.card V) 0 ℓ 0Empty graphs are strongly regular. Note that ℓ can take any value
for empty graphs, since there are no pairs of adjacent vertices.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 70 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.
Cites15
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
- Bot.botstatement and proof · cited by 4,720
- Finset.univproof · cited by 3,473
- SimpleGraphstatement · cited by 3,072
- Fintype.cardstatement · cited by 1,386
- SimpleGraph.Adjproof · cited by 1,346
- Finset.filterproof · cited by 949
- Finset.extproof · cited by 565
- Finset.filter_congrproof · cited by 167
- SimpleGraph.commonNeighborsproof · cited by 28
- Fintype.card_ofFinsetproof · cited by 26
- SimpleGraph.IsSRGWithstatement · cited by 17
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.