Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, February 25, 2014, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Wenying Gan
Let it(G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how large it(G) could be in graphs with minimum degree at least δ. They further conjectured that when n≥ 2δ and t≥ 3, it(G) is maximized by the complete bipartite graph Kδ, n-δ . This conjecture has drawn the attention of many researchers recently. In this talk, we prove this conjecture.
Joint work with Po-Shen Loh and Benny Sudakov.
Automatic MiSe System Software Version 1.4803M | admin login