For more information about this meeting, contact Stephen Simpson, Jan Reimann.
|Title:||The random graph and its properties.|
|Speaker:||John Pardo, Pennsylvania State University|
|In graph theory, the probabilistic method of constructing countable graphs with randomly determined edges has been used to prove significant results where traditional methods have failed. Interestingly, these sorts of graphs have also appeared in other areas of mathematics using deterministic means, in particular in logic as the Fraisse limit of a certain class of graphs, and have been found to have some very fascinating properties. In my talk I will explain both the probabilistic and deterministic constructions as well as some of those fascinating properties, in the process showing that the random graph may not be as random as it first appears.|
Room Reservation Information
|Date:||04 / 09 / 2013|
|Time:||02:30pm - 03:45pm|