Theorems · Theorem · combinatorics
SimpleGraph.isExtremal_top_free_turanGraph
∀ {n : ℕ} {α : Type u_2} [inst : Fintype α] [Nontrivial α],
(SimpleGraph.turanGraph n (Fintype.card α - 1)).IsExtremal ⊤.Free- Cited by
- 1 results in Mathlib
- Foundations
- Depth 91 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeNontrivial
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- Fintypestatement and proof · cited by 7,736
- SimpleGraphstatement · cited by 3,072
- Nontrivialstatement and proof · cited by 2,416
- Fintype.cardstatement · cited by 1,386
- SimpleGraph.Freestatement · cited by 39
- Fintype.one_lt_cardproof · cited by 18
- SimpleGraph.turanGraphstatement · cited by 14
- SimpleGraph.IsExtremalstatement · cited by 9
- SimpleGraph.isExtremal_top_free_iff_isTuranMaximalproof · cited by 2
- SimpleGraph.isTuranMaximal_turanGraphproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.extremalNumber_topproof · cited by 0