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, July 17, 2008, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Jeong Han Kim (Yonsei Univ., South Korea)

Random Graphs, Random Regular Graphs and Couplings

The study of random regular graphs, started in late 70's, has recently attracted much attention. Main questions in this area have been whether the random regular graph contains a perfect matching, a Hamilton cycle, and a Hamilton decomposition. These properties are closely related to the contiguity of random models. Roughly speaking, two models are contiguous if they are essentially the same. For example, one may consider the uniform random 3-regular graph and the union of three independent random perfect matchings, and ask whether the two models are essentially the same or not. We will discuss contiguity of various random regular graph models.

We will also introduce some attempts to study random graphs by means of random regular graphs.

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