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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 11, 2017, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Frank Mousset

Minimum degree conditions for large trees

There is a great deal of interest in finding minimum degree conditions for various spanning structures in a graph: for example, Dirac's theorem does this for Hamilton cycles (if the minimum degree is at least n/2). Here I will talk about such a condition for embedding trees of linear size.

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

Previous talks by year:   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