Wiki
Wiki

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 nn vertices containing no complete graph on kk vertices, the graph D(n,k)D(n,k) has the maximum number of edges, and is the only such graph; here D(n,k)D(n,k) joins two vertices exactly when their labels in 1,…,n1,\dots,n are incongruent modulo k−1k-1, and it has 12(k−2)(k−1)−1(n2−r2)+(r2)\frac12(k-2)(k-1)^{-1}(n^2-r^2)+\binom r2 edges, where rr is the remainder of nn on division by k−1k-1. The case k=3k=3, 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 nn vertices with more than ⌊n2/4⌋\lfloor n^2/4\rfloor edges contains a triangle. The extremal graph D(n,3)D(n,3) is the complete bipartite graph K⌊n/2⌋,⌈n/2⌉K_{\lfloor n/2\rfloor,\lceil n/2\rceil}, which has ⌊n2/4⌋\lfloor n^2/4\rfloor edges, no triangle and, for n≥2n\ge2, chromatic number 22. So, in the conventions of Problem 1011, f2(n)=⌊n2/4⌋+1f_2(n)=\lfloor n^2/4\rfloor+1 for every n≥2n\ge2; Erdős's 1971 list gives the same value as u2=[14n2]+1u_2=[\tfrac14n^2]+1, "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 r=2r=2: f2(n)=⌊n2/4⌋+1f_2(n)=\lfloor n^2/4\rfloor+1 for every n≥2n\ge2, the condition being vacuous for n=1n=1. Nothing about r≥3r\ge3.

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.