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.

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:5fe2f5fefe706975d8d046de4aad41f627dce3cd4f68f027d6718b18c70e2ae9
Metadata
sha256:934820ce70a4ad0a8b7cb6a9a5c6d41530adcd08f1e9e9bfb17cb6cfca3dbe4d
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:a3a77ecabefd7a05d7053edf8a7b1aa8c175339ef446f559aae1f908deb33a48
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page