Erdős problem 1092 · problems.science

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1092.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1092.leanErdos1092.f_asymptotic_21 lineExact file

1False ↔ (fun n => ↑n) =o[Filter.atTop] fun n => ↑(Erdos1092.f 2 n)

SolvedStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI collaborating with humans
Erdős AI contributions wiki · 28 Apr, 2026
Machine
GPT-5.5 Pro
People
Przemek Chojecki
Open the source record
Solved as stated, hidden constraints
GPT-Erdős
Open the source record
construction
VibeMathed
Machine
GPT-5.5 Pro
People
Przemek Chojecki
Reported outcome
resolved
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science