△-free→lEl≤n2/4 Second Proof. (d+d)=∑d品 uv∈E w∈V △-free→du+d,≤n→(d+dw)≤nlE uu∈E Cauchy-Schwarz 4E2 (handshaking） m n网≥d+d)=上e区a- 4E2 m uU∈E m
-free 㱺 |E| ≤ n2/4 Second Proof. uvE (du + dv) = vV d2 v u v (du + dv) Cauchy-Schwarz ⇤ vV d2 v 1 n ⇤ vV dv ⇥2 = 4|E| 2 n -free ⇥ du + dv n ⇥ uvE (du + dv) n|E| n|E| ⌅ uvE (du + dv) = ⌅ vV d2 v ⇤ vV dv ⇥2 n = 4|E| 2 n (handshaking)
△，-free→lEl≤n2/4 Second Proof. ∑(d+d)=∑品 uw∈E w∈V △-free→d,+d≤n→ ∑(d.+d)≤mE uU∈E Cauchy-Schwarz 4E2 (handshaking) m nE≥ 4E2 n2 > E≤ m 4
-free 㱺 |E| ≤ n2/4 Second Proof. uvE (du + dv) = vV d2 v Cauchy-Schwarz ⇤ vV d2 v 1 n ⇤ vV dv ⇥2 = 4|E| 2 n -free ⇥ du + dv n ⇥ uvE (du + dv) n|E| n|E| 4|E| 2 n (handshaking) |E| n2 4 u v (du + dv)
△-free→lEl≤n2/4 Third Proof. A:maximum independent set a IAl independent v∈V,d,≤a B=V\A B incident to all edges B=IBl Inequality of the arithmetic and geometric mean B scaa≤(2)-
-free 㱺 |E| ≤ n2/4 Third Proof. A: maximum independent set B = V \ A α = |A| β = |B| v ⇤ ⇥ ⌅ dv independent ⇤v ⇥ V, dv B B incident to all edges ⇥ + ⇥ 2 ⇥2 |E| vB dv = n2 4 Inequality of the arithmetic and geometric mean
Turan's Theorem "Suppose G is a Kr-free graph. What is the largest number of edges that G can have?" Paul Turan (1910-1976)
Turán's Theorem Paul Turán (1910-1976) “Suppose G is a Kr -free graph. What is the largest number of edges that G can have?
Turan's Theorem Theorem(Turan 1941) If G(V,E)has IVl=n and is K,-free,then r-2 E≤ n2. 2(r-1
Turán's Theorem Theorem (Turán 1941) If G(V,E) has |V|=n and is Kr-free, then |E| ⇥ r 2 2(r 1)n2