Skip to content

Erdős problem 904

Start work

Let r≥2r\geq 2 and let tr(n)t_r(n) be the Turán number (the maximal number of edges in a graph on nn vertices with no Kr+1K_{r+1}).

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:40c0ab5a99201ccb5a23daafd904ee5766518c3bc44186769a68a0bd6a980f15
Metadata
sha256:59c5cefa28ca93bc9f46b5ae0955b04a3df014222be9c3685a423d0ce60209f8
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:f9ac3506a2d0697e8d786ba3468770852d005e4c8db3a1071f4851d154a34862
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON