A circuitous proof of the Erdos-Gallai Theorem

Meeting Time: Sept. 14, 2010, 2:00-2:50pm

Abstract: The Erdos-Gallai Theorem is a characterization of integer sequences that are degree sequences of a simple graph. We will give an original proof that will take us through several interesting ideas, including the Durfee square, the Gale-Ryser Theorem, network flows, and the Ryser Criterion for degree sequence realizability.