Theorems · Theorem · combinatorics
SimpleGraph.IsSRGWith.regular
∀ {V : Type u} [inst : Fintype V] {G : SimpleGraph V} [inst_1 : DecidableRel G.Adj] {n k ℓ μ : ℕ},
G.IsSRGWith n k ℓ μ → G.IsRegularOfDegree k- Cited by
- 4 results in Mathlib
- Foundations
- Depth 59 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.
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
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.neighborSetstatement · cited by 257
- SimpleGraph.IsSRGWithstatement and proof · cited by 17
- SimpleGraph.IsRegularOfDegreestatement · cited by 10
Cited by4
Results whose statement or proof uses this declaration.
- SimpleGraph.IsSRGWith.card_neighborFinset_union_eqproof · cited by 2
- SimpleGraph.IsSRGWith.compl_is_regularproof · cited by 1
- SimpleGraph.IsSRGWith.param_eqproof · cited by 0
- SimpleGraph.IsSRGWith.matrix_eqproof · cited by 0