Theorems · Definition · combinatorics
SimpleGraph.IsTuranMaximal.setoid
{V : Type u_1} →
[inst : Fintype V] → {G : SimpleGraph V} → [inst_1 : DecidableRel G.Adj] → {r : ℕ} → G.IsTuranMaximal r → Setoid VThe non-adjacency setoid over the vertices of a Turán-maximal graph
induced by equivalence_not_adj.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 82 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.
Cites5
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
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement and proof · cited by 1,346
- SimpleGraph.IsTuranMaximalstatement and proof · cited by 19
- SimpleGraph.IsTuranMaximal.equivalence_not_adjproof · cited by 0
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.IsTuranMaximal.finpartitionproof · cited by 7
- SimpleGraph.IsTuranMaximal.degree_eq_card_sub_part_cardproof · cited by 1