Title: Coloring Graphs with Given Crossing Numbers
Megan Heenehan, Alison McDonough, Jennifer Wise
Abstract:
The Four Color Theorem tells us that a graph with no crossings is four colorable, but what about graphs with crossings? We'll show you how many colors it takes to color a graph with up to six crossings.
We will prove cases that lead to a weakening of the Hajós Conjecture. We conjecture that if the chromatic number of a graph G is greater than or equal to r, then the crossing number of G is greater than or equal to the crossing number of the complete graph on r vertices.
Time:
1:00pm - 4:00pm
Location:
Burton 3rd Floor
Description:
MTH 300 hosts an afternoon of activities for 9th and 10th grade girls. Contact Ruth Haas for more information.