a variation on the four color problemjli/talks/variationfourcolorproblem.pdf24g+1 2 k jennifer...
TRANSCRIPT
![Page 1: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/1.jpg)
A Variation on the Four Color Problem
Jennifer Li
Department of MathematicsLouisiana State University
Baton Rouge
![Page 2: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/2.jpg)
History
(1852) Francis Guthrie:
“Do four colors suffice to color every planar map so that adjacentcountries receive different colors?”
The Four Color Problem or The Map Coloring Problem.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 2 / 24
![Page 3: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/3.jpg)
History
(1852) Francis Guthrie:
“Do four colors suffice to color every planar map so that adjacentcountries receive different colors?”
The Four Color Problem or The Map Coloring Problem.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 2 / 24
![Page 4: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/4.jpg)
History
(1852) Francis Guthrie:
“Do four colors suffice to color every planar map so that adjacentcountries receive different colors?”
The Four Color Problem or The Map Coloring Problem.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 2 / 24
![Page 5: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/5.jpg)
Planar Maps
Examples:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 3 / 24
![Page 6: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/6.jpg)
Example
The planar map below is colored with four colors.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 4 / 24
![Page 7: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/7.jpg)
From Map to Graph
We can depict maps abstractly as graphs.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 5 / 24
![Page 8: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/8.jpg)
From Map to Graph
We can depict maps abstractly as graphs.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 5 / 24
![Page 9: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/9.jpg)
From Map to Graph
We can depict maps abstractly as graphs.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 5 / 24
![Page 10: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/10.jpg)
Chromatic Number
Least number of colors needed, denoted by χ(G )
Examples:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 6 / 24
![Page 11: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/11.jpg)
Chromatic Number
Least number of colors needed, denoted by χ(G )Examples:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 6 / 24
![Page 12: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/12.jpg)
Chromatic Number
Least number of colors needed, denoted by χ(G )Examples:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 6 / 24
![Page 13: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/13.jpg)
Another Coloring Problem
Many attempts to prove the Four Color Problem!
1879 A. Kempe1890 P. Heawood
What Heawood did:
1.
2.
3. Another question:
How many colors are required for graphs embedded on surfaces other thanthe plane?
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 7 / 24
![Page 14: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/14.jpg)
Another Coloring Problem
Many attempts to prove the Four Color Problem!
1879 A. Kempe
1890 P. Heawood
What Heawood did:
1.
2.
3. Another question:
How many colors are required for graphs embedded on surfaces other thanthe plane?
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 7 / 24
![Page 15: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/15.jpg)
Another Coloring Problem
Many attempts to prove the Four Color Problem!
1879 A. Kempe1890 P. Heawood
What Heawood did:
1.
2.
3. Another question:
How many colors are required for graphs embedded on surfaces other thanthe plane?
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 7 / 24
![Page 16: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/16.jpg)
Another Coloring Problem
Many attempts to prove the Four Color Problem!
1879 A. Kempe1890 P. Heawood
What Heawood did:
1.
2.
3. Another question:
How many colors are required for graphs embedded on surfaces other thanthe plane?
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 7 / 24
![Page 17: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/17.jpg)
Another Coloring Problem
Many attempts to prove the Four Color Problem!
1879 A. Kempe1890 P. Heawood
What Heawood did:
1.
2.
3. Another question:
How many colors are required for graphs embedded on surfaces other thanthe plane?
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 7 / 24
![Page 18: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/18.jpg)
Another Coloring Problem
Many attempts to prove the Four Color Problem!
1879 A. Kempe1890 P. Heawood
What Heawood did:
1.
2.
3. Another question:
How many colors are required for graphs embedded on surfaces other thanthe plane?
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 7 / 24
![Page 19: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/19.jpg)
Another Coloring Problem
Many attempts to prove the Four Color Problem!
1879 A. Kempe1890 P. Heawood
What Heawood did:
1.
2.
3. Another question:
How many colors are required for graphs embedded on surfaces other thanthe plane?
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 7 / 24
![Page 20: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/20.jpg)
Another Coloring Problem
Many attempts to prove the Four Color Problem!
1879 A. Kempe1890 P. Heawood
What Heawood did:
1.
2.
3. Another question:
How many colors are required for graphs embedded on surfaces other thanthe plane?
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 7 / 24
![Page 21: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/21.jpg)
Other Surfaces
Sphere = simplest surface
Sphere + n handles = new surface
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 8 / 24
![Page 22: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/22.jpg)
Other Surfaces
Sphere = simplest surface
Sphere + n handles = new surface
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 8 / 24
![Page 23: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/23.jpg)
Other Surfaces (continued)
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 9 / 24
![Page 24: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/24.jpg)
Other Surfaces (continued)
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 10 / 24
![Page 25: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/25.jpg)
Embedding Graphs on Other Surfaces
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 11 / 24
![Page 26: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/26.jpg)
Embedding Graphs on Other Surfaces
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 11 / 24
![Page 27: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/27.jpg)
Embedding Graphs on Other Surfaces
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 11 / 24
![Page 28: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/28.jpg)
Embedding Graphs on Other Surfaces (continued)
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 12 / 24
![Page 29: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/29.jpg)
Embedding Graphs on Other Surfaces (continued)
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 12 / 24
![Page 30: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/30.jpg)
Stereographic Projection
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 13 / 24
![Page 31: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/31.jpg)
Graph Embedding Examples
K5 is not planar, but is toroidal:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 14 / 24
![Page 32: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/32.jpg)
Graph Embedding Examples
K5 is not planar, but is toroidal:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 14 / 24
![Page 33: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/33.jpg)
Graph Embedding Examples
K5 is not planar, but is toroidal:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 14 / 24
![Page 34: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/34.jpg)
Faces of a Graph
Example:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 15 / 24
![Page 35: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/35.jpg)
Faces of a Graph
Example:
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 15 / 24
![Page 36: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/36.jpg)
Euler-Poincare Formula
v = verticese = edgesf = faces
For a connected, nonempty planar graph,
v − e + f = 2.
The Euler genus g is defined to be
g = 2− (v − e + f )
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 16 / 24
![Page 37: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/37.jpg)
Euler-Poincare Formula
v = verticese = edgesf = faces
For a connected, nonempty planar graph,
v − e + f = 2.
The Euler genus g is defined to be
g = 2− (v − e + f )
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 16 / 24
![Page 38: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/38.jpg)
Euler-Poincare Formula
v = verticese = edgesf = faces
For a connected, nonempty planar graph,
v − e + f = 2.
The Euler genus g is defined to be
g = 2− (v − e + f )
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 16 / 24
![Page 39: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/39.jpg)
Example
plane: g = 2− (v − e + f ) = 2− 2 = 0
Torus: g = 2− (5− 10 + 5) = 2− 0 = 2Klein bottle: g = 2− 0 = 2Projective plane: g = 2− 1 = 1
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 17 / 24
![Page 40: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/40.jpg)
Example
plane: g = 2− (v − e + f ) = 2− 2 = 0
Torus: g = 2− (5− 10 + 5) = 2− 0 = 2
Klein bottle: g = 2− 0 = 2Projective plane: g = 2− 1 = 1
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 17 / 24
![Page 41: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/41.jpg)
Example
plane: g = 2− (v − e + f ) = 2− 2 = 0
Torus: g = 2− (5− 10 + 5) = 2− 0 = 2Klein bottle: g = 2− 0 = 2
Projective plane: g = 2− 1 = 1
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 17 / 24
![Page 42: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/42.jpg)
Example
plane: g = 2− (v − e + f ) = 2− 2 = 0
Torus: g = 2− (5− 10 + 5) = 2− 0 = 2Klein bottle: g = 2− 0 = 2Projective plane: g = 2− 1 = 1
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 17 / 24
![Page 43: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/43.jpg)
Heawood’s Conjecture
Heawood used the Euler-Poincare Formula to show:
If G is a loopless graph embedded in surface S with Euler genus g , then
χ(G ) ≤⌊(
7+√24g+12
)⌋
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18 / 24
![Page 44: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/44.jpg)
Heawood’s Conjecture
Heawood used the Euler-Poincare Formula to show:If G is a loopless graph embedded in surface S with Euler genus g , then
χ(G ) ≤⌊(
7+√24g+12
)⌋
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18 / 24
![Page 45: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/45.jpg)
Heawood’s Conjecture
Heawood used the Euler-Poincare Formula to show:If G is a loopless graph embedded in surface S with Euler genus g , then
χ(G ) ≤⌊(
7+√24g+12
)⌋
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18 / 24
![Page 46: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/46.jpg)
Example
Let S be the torus, which has Euler genus g = 2.
By Heawood’s Formula: For any loopless graph G embedded in S , we have
χ(G ) ≤ 12(7 +
√24 · 2 + 1) = 1
2(7 + 7) = 7
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 19 / 24
![Page 47: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/47.jpg)
Proof of Conjecture
Heawood proved the cases where g > 0.
For g = 0 (sphere):
χ(G ) ≤ 12(7 +
√24 · 0 + 1) = 1
2(7 + 1) = 4
The Four Color Problem!
BUT...Heawood could not prove this case.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 20 / 24
![Page 48: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/48.jpg)
Proof of Conjecture
Heawood proved the cases where g > 0.
For g = 0 (sphere):
χ(G ) ≤ 12(7 +
√24 · 0 + 1) = 1
2(7 + 1) = 4
The Four Color Problem!
BUT...Heawood could not prove this case.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 20 / 24
![Page 49: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/49.jpg)
Proof of Conjecture
Heawood proved the cases where g > 0.
For g = 0 (sphere):
χ(G ) ≤ 12(7 +
√24 · 0 + 1) = 1
2(7 + 1) = 4
The Four Color Problem!
BUT...Heawood could not prove this case.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 20 / 24
![Page 50: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/50.jpg)
Proof of Conjecture
Heawood proved the cases where g > 0.
For g = 0 (sphere):
χ(G ) ≤ 12(7 +
√24 · 0 + 1) = 1
2(7 + 1) = 4
The Four Color Problem!
BUT...Heawood could not prove this case.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 20 / 24
![Page 51: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/51.jpg)
Proof of Conjecture
Heawood proved the cases where g > 0.
For g = 0 (sphere):
χ(G ) ≤ 12(7 +
√24 · 0 + 1) = 1
2(7 + 1) = 4
The Four Color Problem!
BUT...
Heawood could not prove this case.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 20 / 24
![Page 52: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/52.jpg)
Proof of Conjecture
Heawood proved the cases where g > 0.
For g = 0 (sphere):
χ(G ) ≤ 12(7 +
√24 · 0 + 1) = 1
2(7 + 1) = 4
The Four Color Problem!
BUT...Heawood could not prove this case.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 20 / 24
![Page 53: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/53.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound? Yes, for every surface EXCEPT Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.1967, T. Youngs: Simplified Ringel’s solution.1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 54: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/54.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound?
Yes, for every surface EXCEPT Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.1967, T. Youngs: Simplified Ringel’s solution.1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 55: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/55.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound? Yes, for every surface EXCEPT
Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.1967, T. Youngs: Simplified Ringel’s solution.1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 56: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/56.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound? Yes, for every surface EXCEPT Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.1967, T. Youngs: Simplified Ringel’s solution.1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 57: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/57.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound? Yes, for every surface EXCEPT Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.1967, T. Youngs: Simplified Ringel’s solution.1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 58: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/58.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound? Yes, for every surface EXCEPT Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.1967, T. Youngs: Simplified Ringel’s solution.1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 59: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/59.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound? Yes, for every surface EXCEPT Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.
1967, T. Youngs: Simplified Ringel’s solution.1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 60: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/60.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound? Yes, for every surface EXCEPT Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.1967, T. Youngs: Simplified Ringel’s solution.
1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 61: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/61.jpg)
Best Bound?
Every map on surface S with Euler genus g can be colored with at most⌊(7+
√24g+12
)⌋colors.
Is this the best bound? Yes, for every surface EXCEPT Klein bottle!
The formula gives χ(G ) ≤ (12)(7 +√
24 · 2 + 1) = (12)(7 + 7) = 7
1934, P. Franklin: Klein bottle requires at most 6 colors.
1954, G. Ringel: Heawood conjecture gives the best bound for every othersurface.1967, T. Youngs: Simplified Ringel’s solution.1974, Ringel-Youngs Theorem published.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 21 / 24
![Page 62: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/62.jpg)
A Correct Solution!
1977, Appel, Haken: The Four Color Problem
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 22 / 24
![Page 63: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/63.jpg)
A Correct Solution!
1977, Appel, Haken: The Four Color Problem
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 22 / 24
![Page 64: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/64.jpg)
A Correct Solution!
1977, Appel, Haken: The Four Color Problem
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 22 / 24
![Page 65: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/65.jpg)
Summary
The Four Color Problem: unsolved for nearly 100 years!
Moreover,Four Color Problem: 1200 hours of computer time on University of
Illinois supercomputer.Heawood’s conjecture: application of the quadratic formula.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 23 / 24
![Page 66: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/66.jpg)
Summary
The Four Color Problem: unsolved for nearly 100 years!
Moreover,
Four Color Problem: 1200 hours of computer time on University ofIllinois supercomputer.
Heawood’s conjecture: application of the quadratic formula.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 23 / 24
![Page 67: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/67.jpg)
Summary
The Four Color Problem: unsolved for nearly 100 years!
Moreover,Four Color Problem:
1200 hours of computer time on University ofIllinois supercomputer.
Heawood’s conjecture: application of the quadratic formula.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 23 / 24
![Page 68: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/68.jpg)
Summary
The Four Color Problem: unsolved for nearly 100 years!
Moreover,Four Color Problem: 1200 hours of computer time on University of
Illinois supercomputer.
Heawood’s conjecture: application of the quadratic formula.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 23 / 24
![Page 69: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/69.jpg)
Summary
The Four Color Problem: unsolved for nearly 100 years!
Moreover,Four Color Problem: 1200 hours of computer time on University of
Illinois supercomputer.Heawood’s conjecture:
application of the quadratic formula.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 23 / 24
![Page 70: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/70.jpg)
Summary
The Four Color Problem: unsolved for nearly 100 years!
Moreover,Four Color Problem: 1200 hours of computer time on University of
Illinois supercomputer.Heawood’s conjecture: application of the quadratic formula.
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 23 / 24
![Page 71: A Variation on the Four Color Problemjli/talks/variationFourColorProblem.pdf24g+1 2 k Jennifer Li(Louisiana State University) A Variation on the Four Color Problem May 2, 2015 18](https://reader033.vdocument.in/reader033/viewer/2022060100/60b1ab8b714e9d60a637f76e/html5/thumbnails/71.jpg)
Thanks to:My project advisor, Professor Oporowski!Federico Salmoiraghi!
Jennifer Li (Louisiana State University) A Variation on the Four Color Problem May 2, 2015 24 / 24