Theorems · Theorem · combinatorics
SimpleGraph.IsRegularOfDegree.compl
∀ {V : Type u_1} [inst : Fintype V] [inst_1 : DecidableEq V] {G : SimpleGraph V} [inst_2 : DecidableRel G.Adj] {k : ℕ},
G.IsRegularOfDegree k → Gᶜ.IsRegularOfDegree (Fintype.card V - 1 - k)- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Compl.complstatement · cited by 2,925
- Fintype.cardstatement and proof · cited by 1,386
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.neighborSetstatement · cited by 257
- SimpleGraph.IsRegularOfDegreestatement and proof · cited by 10
- SimpleGraph.degree_complproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.IsSRGWith.compl_is_regularproof · cited by 1