2/16/2020 -- Intermediate 1A: Some more graph theory

Please use the worksheet from last week.

This week we completed the rest of the Graph Theory packet, going over topics such as the coloring of a graph, which is the least number of colors required to fully "color" a graph. An interesting theory associated with this is that if one considers ANY map that separates the area into counties, states, cities, etc. then one can color that map with four colors such that no two adjacent counties, states, cities, etc. have the same color. This theorem was proved using computers!

Handouts:

Graph Theory Sheet
Solutions

[Edit]

	Info About ORMC Directions History Leadership Mathematics competitions Olga Radko: In Memoriam Opportunities for UCLA students ORMC Projects Our books People Student Research Admission Apply to ORMC MyCircle login ORMC Entry Points Circle Rules Contact us Meetings Current Year Previous Years F.A.Q. Support us Authorized Users Only Mailing lists Member list Registrations Donations Logins in last 2 weeks Site search: ✎̸
	2/16/2020 -- Intermediate 1A: Some more graph theory Please use the worksheet from last week. This week we completed the rest of the Graph Theory packet, going over topics such as the coloring of a graph, which is the least number of colors required to fully "color" a graph. An interesting theory associated with this is that if one considers ANY map that separates the area into counties, states, cities, etc. then one can color that map with four colors such that no two adjacent counties, states, cities, etc. have the same color. This theorem was proved using computers! Handouts: Graph Theory Sheet Solutions [Edit]