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 A. Steger, D. Steurer and B. Sudakov)

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)

Sharp threshold for bounded degree spanning trees with many leaves or a long bare path

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.

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