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 19, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Jozef Skokan (London School of Economics)

An Extension of Dirac's Theorem

A classical result in graph theory, Dirac's Theorem, states that any graph on n>2 vertices with minimum degree at least n/2 contains a cycle through all of its vertices. One of possible generalizations is to decrease the minimum degree of the graph and ask how many cycles are needed to cover its vertices. We answer this question and prove the following: For a fixed integer k>1 and n sufficiently large, if G is an n-vertex graph with minimum degree at least n/k, then there are k - 1 cycles in G covering its vertex set. This bound is best possible, as there are graphs with minimum degree n/k-1 that do not have this property.

This is joint work with Jozsef Balogh (UIUC) and Frank Mousset (ETH).

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