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.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:a3a77ecabefd7a05d7053edf8a7b1aa8c175339ef446f559aae1f908deb33a48
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb