Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 29, 2022, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Kalina Petrova
In 1995, Komlos, Sarkozy, and Szemeredi pinned down the necessary and sufficient minimum degree conditions for a graph to contain all spanning trees of not-too-large degree. I will talk about generalizations of this result to directed graphs and hypergraphs, including a result from work in progress together with Yanitsa Pehova. Namely, we show that every 3-uniform hypergraph with minimum degree (5/9 + epsilon) n(n-1)/2 contains all linear spanning trees of constant maximum degree. I will also mention some interesting open problems along the way.
Automatic MiSe System Software Version 1.4803M | admin login