BYU

Abstract by Kirsti Dorman

Personal Infomation


Presenter's Name

Kirsti Dorman

Degree Level

Undergraduate

Co-Authors

Rebekah Bassett
Vanessa Rico
Jennifer Canizales

Abstract Infomation


Department

Mathematics

Faculty Advisor

Jasbir Chahal

Title

Coloring the Map of Utah

Abstract

The “four color theorem” asserts that any planar graph is four colorablećƒ¼meaning four colors are sufficient to properly color any planar graph. Let p(G,r) be the number of ways to color a graph G with r colors. p(G,r) is a monic polynomial of degree |V(G)| with integer coefficients and is called the chromatic polynomial. It is surprising that no one has computed this polynomial for real world graphs, like the graph of the map of the counties of Utah. The four of us have done that in this project. For the second part of the presentation, we will define a coloring of a map and the corresponding chromatic polynomials for standard graphs.