- The Chromatic Polynomial of a Graph
- Project Year:
2018
- REU Student (s):
Ruby Ortiz | Muhlenberg College PA
- Student 1 Institution:
Muhlenberg College
- Project Mentor:
Nicola Tarasca
- Project Mentor Area:
Mathematics
- Project Abstract:
The chromatic polynomial is shown to be a characteristicof the graph that demonstrates a relation. Then this idea isdeveloped more with matroids and a diversity of graphs. Amatroid can take up different forms from matrices to graphsto simple sets. There are multiple proofs of each graph'schromatic polynomial using the Deletion-Contraction Relation,also presented in Huh's article. The deletion-contractiondevelops an interesting relation between graphs that can thenbe applied further to matroids. The chromatic polynomial of agraph has and continues to expand beyond 2-D graphs and even3-D graphs, which is where work continues to develop.
