CSC 2427 - Topics in Graph Theory: Random Graphs

Instructor: Mike Molloy

Time: Tuesday 4-6 

Room: UC 257


We will study many of the most important properties of random graphs,
including connectivity, clique number, chromatic number, hamiltonicity
and the emergence of the giant component.  We will also study related
random structures such as random instances of k-SAT formulae
and random instances of constraint satisfaction problems.

Background:  A solid background in graph theory, such as
that provided by CSC 2420, is important. A deep background
in probability is not necessary, but one should be comfortable
with basic concepts such as expected values.

Text:  There is no required text, but the book "Random Graphs"
by Janson, Luczak and Rucinski is strongly recommended.