Erdős problem 904 · problems.science

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

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:40c0ab5a99201ccb5a23daafd904ee5766518c3bc44186769a68a0bd6a980f15
Metadata: sha256:59c5cefa28ca93bc9f46b5ae0955b04a3df014222be9c3685a423d0ce60209f8
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:f9ac3506a2d0697e8d786ba3468770852d005e4c8db3a1071f4851d154a34862

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207