Graduate Students
Department Home Undergraduate Graduate CNA CCF Information
Graduate Programs     
Graduate Home Ph D Programs Masters Degree Ph D Program Requirements Course Descriptions Current Courses Admissions Current Graduate Students Graduate Student Seminar SIAM Chapter Seminar Recent Graduates Incoming Students

Apply Now
Graduate Seminar

Brian Kell
Carnegie Mellon University
Title: Chromatic polynomials

Abstract: Given a graph G, how many ways are there to properly color the vertices of G with $\lambda$ colors? We will explore the answer to this question and show that the answer gives a surprising amount of information about the structure of the graph, and that it is even meaningful (in a sense) to ask this question for $\lambda=-1$.

Date: Thursday, October 24, 2013
Time: 5:30 pm
Location: Wean Hall 8220
Submitted by:  Brian Kell