Wed, November 9, 2016
5:00 pm - 6:00 pm
MA052
Title: Chromatic Polynomials
Speaker: Eric Katz (Ohio State University)
Abstract:The chromatic polynomial of a graph is a polynomial that counts the number of proper colorings of the graph. I'll talk about why such a polynomial should exist, introduce some generalizations, and discuss some recently resolved conjectures.