Calendar
What do the largest subgraphs of K_n (or the random graph!) with a particular matching number look like?
Abigail Raz, Rutgers University
Location: Hill GSL
Date & time: Wednesday, 11 October 2017 at 12:10PM - 1:10PM
Abstract: There are many statements across math of the form "a structure with property X must have one of the following forms". We will see a few of these statements focusing on a result by Erdos and Gallai that every largest subgraph of K_n with matching number t must have one of two basic forms (note here largest refers to the number of edges). We will discuss this result as well as how the statement extends to random graphs.
