Introducing
Prezi AI.
Your new presentation assistant.
Refine, enhance, and tailor your content, source relevant images, and edit visuals quicker than ever before.
Trending searches
Loading…
Graph Theory - Coloring Maps
1
Transcript
How many colors do you need to color this pattern?
What do you mean, coloring maps?!
- Four Color Theorem
- Why it works
- Examples
How many colors do you need to color this pattern?
You need three colors to be sure no adjacent edges have the same color.
Four Color Theorem - 1852
You need two colors to be sure no adjacent edges have the same color.
- South African Mathematician
- Student of University College London
- First posed Four Color Theorem when coloring a map of the counties in England
- Has never been proven by humans
- Proven in 1976 by a computer
Francis Guthrie
https://en.wikipedia.org/wiki/Francis_Guthrie
Four Color Theorem
"Given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color."
https://en.wikipedia.org/wiki/Four_color_theorem
How many colors do you need to color this pattern?
You need three colors to be sure no adjacent edges have the same color.
Graph Theory - Coloring Maps
Garrett Hendrickson and Rachael Schauer
Choose a template
Presentations from around the world
Learn more about creating dynamic, engaging presentations with Prezi