Professional Documents
Culture Documents
Graphs
The Solution of the Four-Color Problem
More About Coloring Graphs
KU Mini College
June 5, 2013
1 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
2 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
3 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
4 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
5 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
6 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
7 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
8 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
9 / 60
The Four-Color Theorem
Graphs Coloring Maps
The Solution of the Four-Color Problem History
More About Coloring Graphs
10 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
Graphs
A graph consists of a collection of vertices connected by edges.
vertices
edges
11 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
Graphs
12 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
(a) 2 (b)
2
3 1 5
5
1
4
4
3
Note: crossings (like this) are not vertices.
Planar Graphs
A graph is planar if its vertices and edges can be drawn as points
and line segments with no crossings.
4
4
2 3
1
14 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
15 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
Graph Coloring
vertices = children
edges = pairs of kids to keep separate
colors = tables
16 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
17 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
χ= 4 χ= 3 χ= 3 χ= 2
χ= 3 χ= 2
χ= 5 χ= 2 χ= 4
18 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
Graph Coloring
Consider a graph whose vertices are a 9 × 9 grid of points.
Two vertices are joined by an edge if they are in the same row,
column, or 3 × 3 subregion.
You are given a partial proper coloring and told to extend it to all
vertices. Does this sound familiar? It’s a Sudoku puzzle!
19 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
20 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
v = 13 v=6
e = 19 e = 12
f=8 f=8
21 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
Euler’s Formula
Then,
v − e + f = 2.
22 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
sea
sea
sea
field #2
field #3
sea field #6 sea
field #5
field #4
sea
I Each time a dike breaks, the raging sea rushes into one of the
fields, and there is one fewer field than before.
I There are still some dikes left, but they’re now just piers
extending into the sea.
24 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
sea
sea
sea
v = 12
e = 16
f =6
sea sea
sea
25 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
sea
sea
sea
v = 12
e = 15
f =5
sea sea
sea
26 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
sea
sea
sea
v = 12
e = 11
f =1
sea sea
sea
27 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
sea
sea
sea
v = 11
e = 10
f =1
sea sea
sea
28 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
sea
sea
sea
v = 10
e=9
f =1
sea sea
sea
29 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
sea
sea
sea
v=2
e=1
f =1
sea sea
sea
30 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
sea
sea
sea
v=1
e=0
f =1
sea sea
sea
31 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
v = 1, e = 0, f = 1, v − e + f = 2.
32 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
33 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
2 4
6 1
8
3
blue:
face lengths 3
2
6 3
red:
vertex degrees 4
4
3 2
3
2 4
34 / 60
The Four-Color Theorem Definitions and Examples
Graphs Planar Graphs
The Solution of the Four-Color Problem Coloring Graphs
More About Coloring Graphs Euler’s Formula
35 / 60
The Four-Color Theorem The Six-Color Theorem
Graphs Appel and Haken’s Proof
The Solution of the Four-Color Problem Reactions to Appel and Haken’s Proof
More About Coloring Graphs Recent Developments
Theorem
Every planar graph can be colored with 6 or fewer colors.
Idea: Find the right order in which to color the vertices so that we
will never need more than 6 colors.
36 / 60
The Four-Color Theorem The Six-Color Theorem
Graphs Appel and Haken’s Proof
The Solution of the Four-Color Problem Reactions to Appel and Haken’s Proof
More About Coloring Graphs Recent Developments
10
12
3
8
7
11
Palette
14
2
5
6 13
4
1 9
38 / 60
The Four-Color Theorem The Six-Color Theorem
Graphs Appel and Haken’s Proof
The Solution of the Four-Color Problem Reactions to Appel and Haken’s Proof
More About Coloring Graphs Recent Developments
39 / 60
The Four-Color Theorem The Six-Color Theorem
Graphs Appel and Haken’s Proof
The Solution of the Four-Color Problem Reactions to Appel and Haken’s Proof
More About Coloring Graphs Recent Developments
40 / 60
The Four-Color Theorem The Six-Color Theorem
Graphs Appel and Haken’s Proof
The Solution of the Four-Color Problem Reactions to Appel and Haken’s Proof
More About Coloring Graphs Recent Developments
42 / 60
The Four-Color Theorem The Six-Color Theorem
Graphs Appel and Haken’s Proof
The Solution of the Four-Color Problem Reactions to Appel and Haken’s Proof
More About Coloring Graphs Recent Developments
45 / 60
The Four-Color Theorem The Six-Color Theorem
Graphs Appel and Haken’s Proof
The Solution of the Four-Color Problem Reactions to Appel and Haken’s Proof
More About Coloring Graphs Recent Developments
Formal Proof
Formal Proof
Gonthier:
The approach that proved successful for this proof was to
turn almost every mathematical concept into a data
structure or a program, thereby converting the entire
enterprise into one of program verification.
47 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs
C(G,2) = 2 C(G,3) = 12
48 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs
G
X Y Z
49 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs
3 3 2
C(G,k) k(k−1)(k−2)(k−3) k(k−1) k(k−1) k(k−1)(k −3k+1)
50 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs
Even though the chromatic polynomial did not help solve the
Four-Color Problem, it has turned out to be of great theoretical
interest!
51 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs
P(k) = k(k−1) 3
3
P(4) = 4 x 3 = 108
53 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs
55 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs
Perfect Graphs
The chromatic number χ is the fewest colors needed to color G
properly. The clique number ω is the greatest number of mutually
adjacent vertices in G .
χ=3 χ=2
ω=3 ω=2
χ= 4
ω=2
χ=4 χ=3
ω=4 ω=2
Perfect Graphs
A graph G is perfect if χ = ω for any induced subgraph.
(What’s an induced subgraph? Choose some of the vertices of G
and all the edges that connect the vertices you’ve chosen.)
57 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs
Perfect Graphs
59 / 60
The Four-Color Theorem
Chromatic Polynomials
Graphs
The Chromatic Symmetric Function
The Solution of the Four-Color Problem
Perfect Graphs
More About Coloring Graphs