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: Thursday, April 14, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Matthew Kwan

Counting spanning trees in random regular graphs

The number of spanning trees in a graph is an important parameter in a surprising range of contexts. Particular attention has been given to regular graphs. We obtain a sharp asymptotic formula for the expected number of spanning trees in a random d-regular graph on n vertices, d = o(n^{1/3}). I will very briefly outline the proof, and then focus on an interesting component of the proof: analysis of a martingale based on the Prüfer code to establish concentration of a certain function over random trees. Joint work with Catherine Greenhill, Mikhail Isaev and Brendan McKay.

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