dsfsfs

© All Rights Reserved

4 views

dsfsfs

© All Rights Reserved

- billings rsum
- Barbour Leibniz
- Lewin - Transformational Techniques in Atonal and Other Music Theories
- Bibilography
- Quadratic Functions
- Abstracts 2008
- aplicatie matematica cu desene pentru grafuri
- Tremblay Chap 19
- Chinease Postman Problem
- Resolucao 2008-2009 - s2-t2
- AlgebraGraphingQuadraticsUsingAllThreeFormsQuickPracticeFreebie
- graph
- billings resume
- Lovasz Discrete and Continuous
- 03graphs-2x2
- Exam Review
- Hecataeus Reference
- acl14
- [3] R(3,10) = 42-2
- neucom05-63

You are on page 1of 3

David Conlon

Lecture 1

The basic statement of extremal graph theory is Mantels theorem, proved in 1907, which states that

any graph on n vertices with no triangle contains at most n2 /4 edges. This is clearly best possible, as

one may partition the set of n vertices into two sets of size bn/2c and dn/2e and form the complete

bipartite graph between them. This graph has no triangles and bn2 /4c edges.

As a warm-up, we will give a number of different proofs of this simple and fundamental theorem.

Theorem 1 (Mantels theorem) If a graph G on n vertices contains no triangle then it contains

2

at most n4 edges.

First proof Suppose that G has m edges. Let x and y be two vertices in G which are joined by an

edge. If d(v) is the degree of a vertex v, we see that d(x) + d(y) n. This is because every vertex in

the graph G is connected to at most one of x and y. Note now that

X

X

d2 (x) =

(d(x) + d(y)) mn.

x

x d(x)

xyE

X

d (x)

2

x d(x))

Therefore

4m2

.

n

4m2

mn,

n

2

Second proof We proceed by induction on n. For n = 1 and n = 2, the result is trivial, so assume

that we know it to be true for n 1 and let G be a graph on n vertices. Let x and y be two adjacent

vertices in G. As above, we know that d(x)+d(y) n. The complement H of x and y has n2 vertices

and since it contains no triangles must, by induction, have at most (n 2)2 /4 edges. Therefore, the

total number of edges in G is at most

e(H) + d(x) + d(y) 1

(n 2)2

n2

+n1=

,

4

4

where the 1 comes from the fact that we count the edge between x and y twice.

Third proof Let A be the largest independent set in the graph G. Since the neighborhood of every

vertex x is an independent set, we must have d(x) |A|. Let B be the complement of A. Every edge

in G must meet a vertex of B. Therefore, the number of edges in G satisfies

X

|A| + |B| 2 n2

e(G)

d(x) |A||B|

=

.

2

4

xB

Suppose that n is even. Then equality holds if and only if |A| = |B| = n/2, d(x) = |A| for every

x B and B has no internal edges. This easily implies that the unique structure with n2 /4 edges is a

bipartite graph with equal partite sets. For n odd, the number of edges is maximised when |A| = dn/2e

and |B| = bn/2c. Again, this yields a unique bipartite structure.

2

The last proof tells us that not only is bn2 /4c the maximum number of edges in a triangle-free graph

but also that any triangle-free graph with this number of edges is bipartite with partite sets of almost

equal size.

The natural generalisation of this theorem to cliques of size r is the following, proved by Paul Tur

an

in 1941.

Theorem 2 (Tur

ans theorem) If a graph G on n vertices

2 contains no copy of Kr+1 , the complete

graph on r + 1 vertices, then it contains at most 1 1r n2 edges.

First proof By induction on n. The theorem is trivially true for n = 1, 2, . . . , r. We will therefore

assume that it is true for all values less than n and prove it for n. Let G be a graph on n vertices

which contains no Kr+1 and has the maximum possible number of edges. Then G contains copies of

Kr . Otherwise, we could add edges to G, contradicting maximality.

Let A be a clique of size r and let B be its complement. Since B has size n r and contains no Kr+1 ,

2

edges in B. Moreover, since every vertex in B can have at most r 1

there are at most 1 1r (nr)

2

neighbours in A, the number of edges between A and B is at most (r 1)(n r). Summing, we see

that

r

1 (n r)2

1 n2

e(G) = eA + eA,B + eB

+ (r 1)(n r) + 1

= 1

,

2

r

2

r 2

where eA , eA,B and eB are the number of edges in A, between A and B and in B respectively. The

theorem follows.

2

Second proof We again assume that G contains no Kr+1 and has the maximum possible number

of edges. We will begin by proving that if xy

/ E(G) and yz

/ E(G), then xz

/ E(G). This implies

that the property of not being connected in G is an equivalence relation. This in turn will imply that

the graph must be a complete multipartite graph.

Suppose, for contradiction, that xy

/ E(G) and yz

/ E(G), but xz E(G). If d(y) < d(x) then we

may construct a new Kr+1 -free graph G0 by deleting y and creating a new copy of the vertex x, say

x0 . Since any clique in G0 can contain at most one of x and x0 , we see that G0 is Kr+1 -free. Moreover,

|E(G0 )| = |E(G)| d(y) + d(x) > |E(G)|,

contradicting the maximality of G. A similar conclusion holds if d(y) < d(z). We may therefore

assume that d(y) d(x) and d(y) d(z). We create a new graph G00 by deleting x and z and creating

two extra copies of the vertex y. Again, this has no Kr+1 and

|E(G00 )| = |E(G)| (d(x) + d(z) 1) + 2d(y) > |E(G)|,

2

We now know that the graph is a complete multipartite graph. Clearly, it can have at most r parts.

We will show that the number of edges is maximised when all of these parts have sizes which differ

by at most one. Indeed, if there were two parts A and B with |A| > |B| + 1, we could increase the

number of edges in G by moving one vertex from A to B. We would lose |B| edges by doing this, but

gain |A| 1. Overall, we would gain |A| 1 |B| 1.

2

This second proof also determines the structure of the extremal graph, that is, it must be r-partite

with all parts having size as close as possible. So if n = mr + q, we get q sets of size m + 1 and r q

sets of size m.

- billings rsumUploaded byapi-241504024
- Barbour LeibnizUploaded bydaukszda
- Lewin - Transformational Techniques in Atonal and Other Music TheoriesUploaded byRick Rite
- BibilographyUploaded byVandana Sharma
- Quadratic FunctionsUploaded byNorazah Ahmad
- Abstracts 2008Uploaded byEpic Win
- aplicatie matematica cu desene pentru grafuriUploaded byBicyy
- Tremblay Chap 19Uploaded byPrashant Kulkarni
- Chinease Postman ProblemUploaded byvk100
- Resolucao 2008-2009 - s2-t2Uploaded byChevronelle
- AlgebraGraphingQuadraticsUsingAllThreeFormsQuickPracticeFreebieUploaded byIvan Jerkovic
- graphUploaded byMàddìRèxxShìrshír
- billings resumeUploaded byapi-241504024
- Lovasz Discrete and ContinuousUploaded byVasiliki Velona
- 03graphs-2x2Uploaded byanarki417
- Exam ReviewUploaded byScott Henkel
- Hecataeus ReferenceUploaded byBoddu Manoj
- acl14Uploaded byMuhammad Rizki Pratama
- [3] R(3,10) = 42-2Uploaded byCaerusKaru
- neucom05-63Uploaded byrockingstar_nit
- graphing logarithmsUploaded byapi-375335148
- SFG_MasonUploaded byIrvan Zikri
- Unsing Influence DiagramsUploaded byعلي علي
- Autonomous Exploration and Motion Planning for an Unmanned Aerial Vehicle Navigating RiversUploaded byPaul Diaz
- A Commonly Studied PatternUploaded bySrinivas
- EMBEDDED SYS DOC.Uploaded bySAMRENDRA KUMAR
- ITED 106 SyllabusUploaded byClay Delgado
- Unit24_TopologicalSortUploaded byarijitnirmal
- 08 Network Flow ProblemsUploaded byKuppu Karthi
- Min SpanningUploaded byTuấn Trần

- 105_09_wwwUploaded byĐức Dương
- Solution 1Uploaded byĐức Dương
- EGT1Uploaded byĐức Dương
- Graph Theory ExtremalUploaded byjalalvahed
- 479090Uploaded byĐức Dương
- 02-brutalUploaded byĐức Dương
- 2ngameUploaded byĐức Dương
- 3n Room ProblemUploaded byĐức Dương
- [123doc.vn] - Chia Dang Dung Cua Tu Trong Tieng AnhUploaded byĐức Dương
- 7 (1)Uploaded byĐức Dương
- 3rdproblemlecturenotes.psUploaded byĐức Dương
- 1.4Uploaded byĐức Dương
- 2011problems AprilUploaded byĐức Dương
- A Symmetric SpaceUploaded byĐức Dương
- Prob 2008Uploaded byĐức Dương
- Phrasal Verbs for FceUploaded byĐức Dương
- 2006 4 Symmetric FunctionsUploaded byĐức Dương
- 8Uploaded byFernando Arnaldo
- 3dicesolnUploaded byĐức Dương
- 5 (2)Uploaded byĐức Dương
- 7Uploaded byAbhinandan Guwahati Vmc
- 91Uploaded byĐức Dương
- 1-1enUploaded byĐức Dương
- 2DrVUploaded byĐức Dương
- 7 (2)Uploaded byĐức Dương
- 3variable. BdtUploaded byThịnh Trần
- 1-beautyUploaded byĐức Dương
- Subiecte Balcaniada de Matematica 2014Uploaded byRaluca Pantazi

- CLT2Uploaded byYagnik Kalariya
- Physicists Infinitesimals Versus Mathematicians DifferentialsUploaded by8310032914
- Quantum mechanicsUploaded byMilli
- Ambient Vibration Testing of Concrete DamsUploaded byjohn banda
- Theory of Seismic Imaging ScalesUploaded bydeepsareen
- China Team Selection Test 2005 47Uploaded byBiswarup Burman
- Conic SectionUploaded byRaj
- FinalUploaded byJaiMehta
- Burkard Rainer E., Dell'Amico Mauro, Martello Silvano - Assignment Problems (2009, Wiley)Uploaded byMax Neves
- An efficient 3D toplogy optimization code written in MATLABUploaded byBarraq_00
- Product of Transcendental 2Uploaded byFarith Farizwan
- The life and work of Fergus Gaines (1939–2001)Uploaded bygylpm
- MK 04-05 Linear Programming The Simplex Method.pptUploaded byMainAdi
- Similarity Estimation Techniques from Rounding AlgorithmsUploaded bymatthewriley123
- Tonge Richard PhysicsForGameUploaded bycametiope
- Computer Algebra and Differential Equations- An OverviewUploaded byGelfanduss
- College AlgebraUploaded byYV Alvis
- Rtiwari Rd Book 05bUploaded bymghgol
- Exercise 2a SolutionUploaded byHiten Tjs
- 2.2 Divergence and Curl OfUploaded byRaghav Chamadiya
- Convex Optimization With Engineering ApplicationsUploaded byErin Fox
- Mason ThesisUploaded byBhuneshwar Prasad
- FP2 Inequalities (Chapter 1)Uploaded byasifjuk6692
- Delhommeau Ship Bow WavesUploaded byStefano
- Short Time Fourier TransformUploaded byzsyed92
- Support Recation ForcesUploaded byAshok
- Reliability of inserts in sandwich composite panelsUploaded bycedemo
- Assignment Set bUploaded byAkmalHelmy
- Research Papers Relativity Theory Science Journal 7106Uploaded bydssgss
- Slides - Introduction to Sensitivity AnalysisUploaded byGeraldo Rossoni Sisquini