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, October 30, 2018, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Miloš Trujić

Randomness doubles the power

In 1998, Komlós, Sárközy, and Szemerédi confirmed the famous Pósa-Seymour conjecture stating that for every positive integer k, every sufficiently large graph with minimum degree at least kn/(k + 1) contains the k-th power of a Hamilton cycle. Very recently, Dudek, Reiher, Ruciński, and Schacht showed that if the minimum degree of a graph is at least (k/(k + 1) + o(1))n then adding O(n) random edges on top almost surely results in a graph which contains the (k + 1)-st power of a Hamilton cycle. We show that the effect of these random edges is significantly stronger, namely that in the same setting one can almost surely find the (2k + 1)-st power. This is a joint work with Rajko Nenadov.


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

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