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, September 20, 2016, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Andreas Noever

Smaller subgraphs of minimal degree k

In 1990 Erdős conjectured that every graph on n vertices with 2n-1 edges contains a subgraph of minimal degree 3 of order at most (1-epsilon)n. A generalization to subgraphs of minimal degree k was also stated. Towards this conjecture Erdős, Faudree, Rousseau and Schelp proved that one can always remove at least C * n^{1/2} vertices. We improve this to C * n / log n. Joint work with Frank Mousset, Rajko Nenadov, Yury Person and Nemanja Škorić.

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