Mar. 6, 3:30pm, Wean 8220
Wesley Pegden, Carnegie Mellon University
Between 2- and 3-colorability
Abstract:
A classical topic in the theory of random graphs is the chromatic number
of Gn,p. We will discuss finer notions of colorability for random
graphs at the bottom end of this scale.
(Joint work with Alan Frieze.)
The ACO Seminar (2013–2014)