Speaker:  Nick Wormald, University of Melbourne
Time:     Tuesday, December 4 at 14:30
Place:    HP4369 School of Math and Stats, Carleton University
Title:    Models of random regular graphs    

Abstract:
This is a survey of results on properties of random regular graphs,
together with an exposition of some of the main methods of obtaining these
results.  A major feature in this area is the small subgraph
conditioning method. This establishes a relationship between random
regular graphs with uniform distribution, and other non-uniform models of
random regular graphs in which the probability of a graph occurring is
weighted according to some random variable. Information can be obtained in
this way
on the probability of existence of various types of spanning
subgraphs, such as Hamilton cycles and decompositions into perfect
matchings, as well as other properties such as smallest dominating set.
Some results about interesting non-uniform models appear as spin-offs from
the same method.