Skip to content

Erdős problem 1092

Is it true that f2(n)≫nf_2(n) \gg n? Disproved by Rödl, who showed fr(n)=o(n)f_r(n) = o(n) for all fixed r≥2r \geq 2. A conjecture of Erdős, Hajnal, and Szemerédi.

Sources

The source's own material, retained exactly.

2 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

1092.lean

Retained formal statement2 of 2

More generally, is fr(n)≫rnf_r(n)\gg_r n? Disproved by Rödl, who showed fr(n)=o(n)f_r(n) = o(n) for all fixed r≥2r \geq 2.

FormalConjectures/ErdosProblems/1092.leanErdos1092.f_asymptotic_general1 lineExact file
False ↔ ∀ (r : ℕ), (fun n => ↑r * ↑n) =o[Filter.atTop] fun n => ↑(Erdos1092.f r n)
SolvedStatement only, no proof