The four colour theorem

Slides:



Advertisements
Similar presentations
Languages Generated by Programmed Grammars with Various Graphs
Advertisements

Planar Graphs: Coloring and Drawing
Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv 1.
Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.
The Four Color Theorem (4CT)
9.7 Planar Graphs. Intro problem- 3 houses and 3 utilities K 3,3 problem: Can 3 houses be connected to 3 utilities so that no 2 lines cross? Similarly,
Cubic Subgraphs Why? Why not?. 5 vertices, 8 edges, claw-free, no cubic subgraph.
Applied Combinatorics, 4th Ed. Alan Tucker
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set S  V(G) such that G-S has more than one component. a b c d e f g h i.
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
1 Section 8.2 Graph Terminology. 2 Terms related to undirected graphs Adjacent: 2 vertices u & v in an undirected graph G are adjacent (neighbors) in.
FOUR COLOR THEOREM. A graph has been colored if a color has been assigned to each vertex in such a way that adjacent vertices have different colors. In.
Applied Combinatorics, 4th Ed. Alan Tucker
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
Computational Geometry Seminar Lecture 1
Tucker, Applied Combinatorics, Section 1.4, prepared by Patti Bodkin
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that S has more than one component. Connectivity of G ((G)): The.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
Definition Dual Graph G* of a Plane Graph:
Theorem Every planar graph is 5-colorable.
Crossing Lemma - Part I1 Computational Geometry Seminar Lecture 7 The “Crossing Lemma” and applications Ori Orenbach.
CTIS 154 Discrete Mathematics II1 8.2 Paths and Cycles Kadir A. Peker.
Drawing of G. Planar Embedding of G Proposition Proof. 1. Consider a drawing of K 5 or K 3,3 in the plane. Let C be a spanning cycle. 2. If the.
MCA 520: Graph Theory Instructor Neelima Gupta
What is the next line of the proof? a). Assume the theorem holds for all graphs with k edges. b). Let G be a graph with k edges. c). Assume the theorem.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that G-S has more than one component. d f b e a g c i h.
Curve Curve: The image of a continous map from [0,1] to R 2. Polygonal curve: A curve composed of finitely many line segments. Polygonal u,v-curve: A polygonal.
Homework solution Problem 2. The number of odd degree vertices in a graph is even. (recom. book: G. Harary: Graph Theory) Solution: Let G=(V,E,w) S= 
9.2 Graph Terminology and Special Types Graphs
Graph Theory Ch6 Planar Graphs. Basic Definitions  curve, polygon curve, drawing  crossing, planar, planar embedding, and plane graph  open set  region,
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
Subdivision of Edge In a graph G, subdivision of an edge uv is the operation of replacing uv with a path u,w,v through a new vertex w.
Graphs Chapter 10.
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
On Edge-Balance Index Sets of L-Product of Cycles by Cycles Daniel Bouchard, Stonehill College Patrick Clark, Stonehill College Hsin-hao Su, Stonehill.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
9.2: Graph Terminology. Special Simple Graphs Complete GraphsK 1,… CyclesC 3,… WheelsW 3,… N-cubesQ 1,… Complete bipartiteK 2,2,…
MATH 370 Final Review Chapter Know this well Chapter 5 and 6: Counting/ Probability Basic counting P(n,r), C(n,r), C(n-1+r,r),… Basic probability,
 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.
V Spanning Trees Spanning Trees v Minimum Spanning Trees Minimum Spanning Trees v Kruskal’s Algorithm v Example Example v Planar Graphs Planar Graphs v.
Planar Graphs Graph Coloring
Planar graphs with no 5- cycles, 6-cycles or intersecting triangles are 3-colorable Carl Yerger, Davidson College Clemson Mini-Conference 2012.
Graph Theory and Applications
Chap. 11 Graph Theory and Applications 1. Directed Graph 2.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Lecture 52 Section 11.2 Wed, Apr 26, 2006
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Introduction to Graph Theory
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Planarity Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT.
Chapter 7 Planar Graphs 大葉大學 資訊工程系 黃鈴玲  7.2 Planar Embeddings  7.3 Euler’s Formula and Consequences  7.4 Characterization of Planar Graphs.
Outline 1 Properties of Planar Graphs 5/4/2018.
Discrete Mathematics Graph: Planar Graph Yuan Luo
The countable character of uncountable graphs François Laviolette Barbados 2003.
Applied Combinatorics, 4th Ed. Alan Tucker
What is the next line of the proof?
Tucker, Applied Combinatorics, Sec 2.4
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
5.4 T-joins and Postman Problems
MAT 2720 Discrete Mathematics
Lecture 10: Graphs Graph Terminology Special Types of Graphs
Planarity.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 8th ed., by Kenneth H.
N(S) ={vV|uS,{u,v}E(G)}
Gaph Theory Planar Graphs
GRAPH THEORY Properties of Planar Graphs Ch9-1.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Lecture 28 Approximation of Set Cover
Treewidth meets Planarity
GRAPH THEORY Properties of Planar Graphs Ch9-1.
Exam 3 review Chapter 9- Graphs.
Presentation transcript:

The four colour theorem

Four colour theorem Thm: Every planar graph is 4 colourable. Let G be a counter-example (planar, non-4-colourable) minimizing |V(G)|.

Use some counting argument Main steps of the proof (5 colours) Main steps of the proof (4 colours) Use some counting argument to find a specific induced subgraph Change parts of the subgraph to make it smaller There is a vertex v of degree at most 5. Delete v Colour the changed graph by minimality Colour the rest by minimality Extend the colouring to the original graph

Main steps Use some counting argument to find a specific induced subgraph Change parts of the subgraph to make it smaller, colour the changed graph by minimality and extend the colouring to the original graph Discharging Reducibility

Connectivity A minimum counter-example to the 4CT is connected

2-connectivity A minimum counter-example to the 4CT is 2-connected

Triangulation deg=5 Take a counter-example maximizing |E(G)| (or equivalently, a triangulation).

Main steps Use some counting argument to find a specific induced subgraph Change parts of the subgraph to make it smaller, colour the changed graph by minimality and extend the colouring to the original graph Discharging Reducibility

Discharging (5 colours) Use some counting argument to find a specific induced subgraph Each edge starts with 2 tokens. Each edge gives one token each vertex incident to it. By Euler’s formula, we have at most 6|V|-12 tokens. So we have a vertex v with at most 5 tokens.

Discharging (4 colours) Use some counting argument to find a specific induced subgraph. Each vertex v starts with 10(6-deg(v)) tokens (now called “charges”). Can be negative. Redistribute the charges using some rules*. By Euler’s formula, we have a vertex v with positive charge after redistributing. The union of v, N(v) and N(N(v)) contains the subgraph we want.

Discharging rules (4 colours) For each copy of the following subgraphs in G, move a charge along the arrow.

Unavoidable subgraph So we’ve used the discharging rules to find one of many specific subgraphs.

Unavoidable subgraphs

Main steps Use some counting argument to find a specific induced subgraph Change parts of the subgraph to make it smaller, colour the changed graph by minimality and extend the colouring to the original graph Discharging Reducibility

Reducibility (5 colours) v

Reducibility (4 colours) The vertex inside help restrict the colouring on the outer ring. Use the colouring of the smaller graph to obtain a colouring of the bigger graph.

p = p or p Switching two colour

Main steps Use some counting argument to find a specific induced subgraph Change parts of the subgraph to make it smaller, colour the changed graph by minimality and extend the colouring to the original graph Discharging Reducibility