Between 2- and 3-colorability

Between 2- and 3-colorability

-
Wesley Pegden , Carnegie Mellon University
Fine Hall 224

A classical topic in the theory of random graphs is the chromatic number of G_{n,p}. We will discuss finer notions of colorability for random graphs at the bottom end of this scale. (Joint work with Alan Frieze.)