Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, February 14, 2019, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Václav Rozhoň
A central question of the extremal graph theory is what is the maximum edge density of a graph that does not contain a certain forbidden substructure. The question is wide open in the case when the forbidden substructure is a bipartite graph. We study the question for the case when the bipartite graph is a tree of order comparable with the order of the host graph. We prove an approximate version of the Erdős-Sós conjecture and an approximate version of a certain generalization of the Loebl-Komlós-Sós conjecture. Joint work with T. Klimošová and D. Piguet.
Automatic MiSe System Software Version 1.4803M | admin login