A proof of the Erdos-Gallai Theorem
Speaker
Stephen Hartke
University of Nebraska, Lincoln
http://www.math.unl.edu/~shartke2/
Description
The Erdos-Gallai Theorem gives a characterization of integer sequences that are degree sequences of a simple graph. We will give a proof that takes us through several interesting combinatorial ideas, including the Durfee square, the Gale-Ryser Theorem, network flows, and the Ryser Criterion for degree sequence realizability. This talk will be accessible to undergraduates with basic knowledge of Graph Theory.
Event Topic
Networks and Optimization