Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, February 14, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Václav Rozhoň

Embedding trees in dense graphs

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login