Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Tuesday, September 19, 2006, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Michael Krivelevich (Tel Aviv University)

Packing Hamilton cycles in random graphs

How many edge disjoint Hamilton cycles can one pack in a graph G? Since every such cycle consumes exactly two edges incident to every vertex of G, the obvious upper bound for this quantity is one half of the minimum degree of G (rounded down, to be more accurate). In our recent work with Alan Frieze we show that for the random graph G(n,p), as long as the edge probability p(n) satisfies: p(n)=o(log n) this trivial upper bound is almost surely tight.

In my talk I will discuss this result, its predecessors and (conjectured) successors, and will also indicate some ideas used in its proof.

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