Undergraduate Math Club
Monday, April 10, 2017 - 4:45pm
Malott 532
One of the most intuitive models for generating a random graph takes a set of n vertices, looks at each possible edge and decides with probability p whether it should be included. We will explore the properties of this model, as well as other methods of using probability to prove results in graph theory. No background knowledge required!