Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 08, 2014, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Richard Montgomery (University of Cambridge)
Following on from the sharp determination of the threshold for a Hamiltonian path appearing in an Erdos-Renyi random graph, attention has been given to more general questions about the threshold for the appearance of other bounded degree spanning trees. We will discuss a recent improvement of the probability required to embed a bounded degree spanning tree into a random graph with high probability, as well as mentioning the related problem of finding all such trees simultaneously.
Automatic MiSe System Software Version 1.4803M | admin login