Theorems · Theorem · combinatorics
SimpleGraph.mul_card_edgeFinset_turanGraph_le
∀ {n r : ℕ}, 2 * r * (SimpleGraph.turanGraph n r).edgeFinset.card ≤ (r - 1) * n ^ 2A looser (but simpler than card_edgeFinset_turanGraph) bound on the number of edges in
turanGraph n r.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 86 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites23
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finset.cardstatement · cited by 2,327
- mul_commproof · cited by 2,262
- LT.lt.leproof · cited by 2,189
- le_reflproof · cited by 2,061
- mul_assocproof · cited by 1,667
- Sym2statement · cited by 737
- add_le_addproof · cited by 666
- le_imp_le_of_le_of_leproof · cited by 576
- Nat.chooseproof · cited by 494
- mul_addproof · cited by 413
- sqproof · cited by 280
- mul_le_mul'proof · cited by 274
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.