Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. P. Turán, Eine Extremalaufgabe aus der Graphentheorie, Mat. Fiz. Lapok 48 (1941), 436--452 (in Hungarian; Zbl 0026.26903), the paper that footnote 1 on p. 122 of Erdős's On a theorem of Rademacher-Turán (Illinois J. Math. 6 (1962); filed as erdos_1962_theorem_rademacher_turan) cites for Turán's theorem. As the zbMATH review of Zbl 0026.26903 states it, the paper proves that among graphs on vertices containing no complete graph on vertices, the graph has the maximum number of edges, and is the only such graph; here joins two vertices exactly when their labels in are incongruent modulo , and it has edges, where is the remainder of on division by . The case , which Mantel proved in 1907, is the statement that p. 122 of Erdős's paper records as "a special case of Turán's theorem": a graph on vertices with more than edges contains a triangle. The extremal graph is the complete bipartite graph , which has edges, no triangle and, for , chromatic number . So, in the conventions of Problem 1011, for every ; Erdős's 1971 list gives the same value as , "the well known theorem of Turán". The record gives the year only, so the page's month and day are placeholders.
Covers. The case : for every , the condition being vacuous for . Nothing about .
Depends on. Nothing in this wiki; Turán's theorem is the whole argument.
Acceptance. Refereed journal publication in Matematikai és Fizikai Lapok,
which is the refereed evidence. The site credits Turán's theorem on a problem
it labels OPEN, which is not acceptance, so reviewed is not listed. The paper
is in Hungarian and is not examined in this corpus; the statement is taken from
the zbMATH review of Zbl 0026.26903, and Erdős's 1962 and 1971 papers, which
quote the theorem, agree with it.