Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information
Date and Time: Friday, October 21, 2011, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Tibor Szabó (Freie Universität Berlin)
We show that any given n-vertex tree with bounded maximum degree and linearly many leaves is contained in the binomial random graph G(n,p) asymptotically almost surely for some p=(1+o(1))log n/n. Furthermore we also show that G(n,p) contains asymptotically almost surely every bounded degree spanning tree T that has a path of linear length whose vertices have degree two in T. This represents joint work with Dan Hefetz and Michael Krivelevich.
Automatic MiSe System Software Version 1.4803M | admin login