Theorems · Theorem · combinatorics
SimpleGraph.exists_isTuranMaximal
∀ {V : Type u_1} [inst : Fintype V] {r : ℕ}, 0 < r → ∃ H x, H.IsTuranMaximal r- Cited by
- 2 results in Mathlib
- Foundations
- Depth 83 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.
Cites7
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.botproof · cited by 4,720
- SimpleGraphstatement and proof · cited by 3,072
- SimpleGraph.Adjstatement · cited by 1,346
- SimpleGraph.CliqueFreeproof · cited by 70
- SimpleGraph.IsTuranMaximalstatement · cited by 19
- SimpleGraph.cliqueFree_botproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.isTuranMaximal_of_isoproof · cited by 3
- SimpleGraph.CliqueFree.card_edgeFinset_leproof · cited by 0