Graduate Seminar

Patrick Bennett
Carnegie Mellon University
Title: The 2-tone chromatic number of sparse random graphs

Abstract: The chromatic number of a graph is the least number of colors needed in order to assign each vertex a color so that no two adjacent vertices have the same color. The t-tone chromatic number is a generalization of the ordinary chromatic number. In this talk I'll discuss the random graph G(n,p), in which each edge is present with probability p independently from all other edges. The word "sparse" means that p will be smallish. In particular, we'll discuss the likely value of the 2-tone chromatic number of G(n,p), where p is smallish.

Date: Tuesday, November 13, 2012
Time: 5:30 pm
Location: Wean Hall 8220
Submitted by:  Brian Kell