|
Department of Mathematical Sciences
Events
People
Colloquia and Seminars
Conferences
Centers
Positions
Areas of Research
About the Department
Alumni |
Algorithms, Combinatorics and Optimization Seminar
Carnegie Mellon University Title: 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.) Date: Thursday, March 6, 2014 Time: 3:30 pm Location: Wean Hall 8220 Submitted by: Boris Bukh |
