# Turán's theorem

In graph theory, Turán's theorem is a result on the number of edges in a Kr+1-free graph.

An n-vertex graph that does not contain any (r + 1)-vertex clique may be formed by partitioning the set of vertices into r parts of equal or nearly equal size, and connecting two vertices by an edge whenever they belong to two different parts. We call the resulting graph the Turán graph T(n, r). Turán's theorem states that the Turán graph has the largest number of edges among all Kr+1-free n-vertex graphs.

Turán graphs were first described and studied by Hungarian mathematician Pál Turán in 1941, though a special case of the theorem was stated earlier by Mantel in 1907.

## Formal statement

Turán's Theorem. Let G be any graph with n vertices, such that G is Kr+1 -free. Then the number of edges in G is at most
${\displaystyle {\frac {r-1}{r}}\cdot {\frac {n^{2}}{2}}=\left(1-{\frac {1}{r}}\right)\cdot {\frac {n^{2}}{2}}.}$

An equivalent formulation is the following:

Turán's Theorem (Second Formulation). Among the n-vertex simple graphs with no (r + 1)-cliques, T(n, r) has the maximum number of edges.

## Proof

Let G be an n-vertex simple graph with no (r + 1)-clique and with the maximum number of edges.

Overview: The proof consists of two claims about G, which we outline, before proving. The first claim is that G must be a complete r-partite graph (although it is stated more technically below). In other words, we can partition the vertex set into r subsets ${\displaystyle S_{1},S_{2},\ldots ,S_{r}}$ such that if two vertices are in different sets, ${\displaystyle S_{i}}$ and ${\displaystyle S_{j}}$, then they have an edge between them, but if they are in the same set, then they have no edge between them. The second claim is that the sizes of these sets ${\displaystyle S_{i}}$ differ from each other by at most 1. For example, if we want the graph on 23 vertices with the most edges that does not contain a triangle, then we partition the vertices into sets ${\displaystyle S_{1}}$ and ${\displaystyle S_{2}}$, with ${\displaystyle |S_{1}|=12}$ and ${\displaystyle |S_{2}|=11}$. We add all the edges between the two sets, so the graph will have 11*12 = 132 edges. This matches with the theorem, which says that G will have at most ${\displaystyle {\frac {1}{2}}{\frac {23^{2}}{2}}={\frac {23^{2}}{4}}=132.25}$ edges.
Claim 1: Graph G does not contain any three vertices u, v, w such that G contains edge uv, but contains neither edge uw nor vw. (This claim is equivalent to the relation x~y iff x not connected to y being an equivalence relation. ~ is always reflexive and symmetric, but only in special cases is it transitive. ~ is not transitive precisely when we have u, v, w with u ~ w and w ~ v without u ~ v.)

Assume the claim is false. Construct a new n-vertex simple graph G′ that contains no (r + 1)-clique but has more edges than G, as follows:

Case 1: ${\displaystyle d(w)

Assume that ${\displaystyle d(w). Delete vertex w and create a copy of vertex u (with all of the same neighbors as u); call it u′. Any clique in the new graph contains at most one vertex among ${\displaystyle \{u,u'\}}$. So this new graph does not contain any (r + 1)-clique. However, it contains more edges:

${\displaystyle |E(G')|=|E(G)|-d(w)+d(u)>|E(G)|.}$

Case 2: ${\displaystyle d(w)\geq d(u)}$ and ${\displaystyle d(w)\geq d(v)}$

Delete vertices u and v and create two new copies of vertex w. Again, the new graph does not contain any (r + 1)-clique. However it contains more edges:

${\displaystyle |E(G')|=|E(G)|-(d(u)+d(v)-1)+2d(w)\geq |E(G)|+1.}$

This proves Claim 1.

The claim proves that one can partition the vertices of G into equivalence classes based on their non-neighbors; i.e. two vertices are in the same equivalence class if they are nonadjacent. This implies that G is a complete multipartite graph (where the parts are the equivalence classes).

Claim 2: The number of edges in a complete k-partite graph is maximized when the size of the parts differs by at most one.

If G is a complete k-partite graph with parts A and B and ${\displaystyle |A|>|B|+1}$, then we can increase the number of edges in G by moving a vertex from part A to part B. By moving a vertex from part A to part B, the graph loses ${\displaystyle |B|}$ edges, but gains ${\displaystyle |A|-1}$ edges. Thus, it gains at least ${\displaystyle |A|-1-|B|\geq 1}$ edge. This proves Claim 2.

This proof shows that the Turan graph has the maximum number of edges. Additionally, the proof shows that the Turan graph is the only graph that has the maximum number of edges.

## Mantel's theorem

As a special case of Turán's theorem, for r = 2, one obtains:

Mantel's Theorem. The maximum number of edges in an n-vertex triangle-free graph is ${\displaystyle \lfloor n^{2}/4\rfloor .}$ (Mantel 1907)

In other words, one must delete nearly half of the edges in Kn to obtain a triangle-free graph.

A strengthened form of Mantel's theorem states that any hamiltonian graph with at least n2/4 edges must either be the complete bipartite graph Kn/2,n/2 or it must be pancyclic: not only does it contain a triangle, it must also contain cycles of all other possible lengths up to the number of vertices in the graph (Bondy 1971).

Another strengthening of Mantel's theorem states that the edges of every n-vertex graph may be covered by at most ${\displaystyle \lfloor n^{2}/4\rfloor }$ cliques which are either edges or triangles. As a corollary, the intersection number is at most ${\displaystyle \lfloor n^{2}/4\rfloor }$ (Erdős, Goodman & Pósa 1966).