Title: What do the largest subgraphs of K_n (or the random graph!) with a particular matching number look like?
Speaker: Abigail Raz, Rutgers University
Date: Wednesday, October 11, 2017 12:10pm
Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ
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.