Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, April 08, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Richard Montgomery (University of Cambridge)

Spanning Trees in Random Graphs

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.

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