CMU Campus
Department of         Mathematical Sciences
Events People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department
Algorithms, Combinatorics and Optimization Seminar

For more information, please visit the home page for the program in Algorithms, Combinatorics and Optimization at Carnegie Mellon University.

Carnegie Mellon University offers an interdisciplinary Ph.D program in Algorithms, Combinatorics and Optimization. This program is the first of its kind in the United States. It is administered jointly by the Tepper School of Business (Operations Research group), the Computer Science Department (Algorithms and Complexity group) and the Department of Mathematical Sciences (Discrete Mathematics group). (Learn more...)

Wesley Pegden
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