Theorems · Theorem · combinatorics
ruzsaSzemerediNumberNat_asymptotic_lower_bound
(fun n => ↑n ^ 2 * Real.exp (-4 * √(Real.log ↑n))) =O[Filter.atTop] fun n => ↑(ruzsaSzemerediNumberNat n)
Asymptotic lower bound on the Ruzsa-Szemerédi problem.
There exists a graph with n vertices and Ω((n ^ 2 * exp (-4 * √(log n)))) edges such that
each edge belongs to exactly one triangle.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 235 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites51
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Realstatement and proof · cited by 25,697
- Norm.normproof · cited by 5,413
- Filter.Tendstoproof · cited by 3,814
- Filter.Eventuallyproof · cited by 3,134
- add_zeroproof · cited by 2,707
- Nat.cast_oneproof · cited by 2,501
- Filter.atTopstatement and proof · cited by 2,405
- Nat.cast_zeroproof · cited by 1,870
- Filter.univ_mem'proof · cited by 1,672
- Filter.mp_memproof · cited by 1,537
- le_of_ltproof · cited by 1,175
- Real.logstatement and proof · cited by 939
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.