Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, July 17, 2008, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Jeong Han Kim (Yonsei Univ., South Korea)
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.
Automatic MiSe System Software Version 1.4803M | admin login