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: Thursday, December 08, 2016, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Milos Trujic

Local resilience of an almost spanning k-cycle in sparse random graphs

Pósa and Seymour conjectured that for any k > 1, a graph with minimum degree at least kn/(k + 1) contains the k-th power of a Hamilton cycle, namely, a Hamilton cycle where additionally between every pair of vertices at distance at most k, there is an edge. Only much later, after appearance of tools such as Szemerédi's Regularity Lemma and the Blow-up Lemma, Komlós, Sárközy, and Szemerédi confirmed the Pósa-Seymour conjecture for large graphs.

We extend the result of Komlós et. al. to random graphs by showing that for all k > 1 and alpha, epsilon > 0, and p > (log n/n)^(1/k), any subgraph of a random graph G(n, p) with minimum degree (k/(k + 1) + alpha)np, w.h.p. contains the k-th power of a cycle on (1 - epsilon)n vertices, thus improving a recent result of Noever and Steger for k = 2, and generalising it to any k. Our result is almost optimal for the following reasons. The constant k/(k+1) in the bound on the minimal degree cannot be improved. When p < n^(-1/k), G(n, p) will not contain the k-th power of a long cycle w.h.p. Finally, just by deleting an epsilon fraction of the edges touching each vertex, it is easy for an adversary to make sure that some vertices are not contained in the k-th power of a cycle, which shows that one cannot hope for an improvement of the result where k-th power of a Hamilton cycle is obtained instead of a cycle on (1 - epsilon)n vertices.

This is joint work with Angelika Steger 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