Theorems · Theorem · combinatorics
SimpleGraph.turanDensity_eq_csInf
∀ {W : Type u_1} (H : SimpleGraph W),
H.turanDensity = sInf {x | ∃ n ∈ Set.Ici 2, ↑(SimpleGraph.extremalNumber n H) / ↑(n.choose 2) = x}- Cited by
- 1 results in Mathlib
- Foundations
- Depth 155 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Realstatement and proof · cited by 25,697
- Set.ofPredstatement and proof · cited by 6,101
- SimpleGraphstatement and proof · cited by 3,072
- Set.Icistatement and proof · cited by 1,070
- InfSet.sInfstatement · cited by 935
- Nat.choosestatement and proof · cited by 494
- IsGLBproof · cited by 213
- SimpleGraph.extremalNumberstatement and proof · cited by 23
- IsGLB.csInf_eqproof · cited by 13
- SimpleGraph.turanDensitystatement and proof · cited by 6
- IsGLB.nonemptyproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.eventually_isContained_of_card_edgeFinsetproof · cited by 1