March 10 2026
ISTA, Raiffeisen Lecture Hall
16:00-18:00
Rényi Institute
March 24 2026
University of Vienna,
Oskar Morgenstern Platz 1, Lecture room 8 (HS8, 1st Floor).
16.45-18:45
Rényi Institute
April 21 2026
ISTA, Raiffeisen Lecture Hall
15:30-18:00
University of Cambridge
May 5 2026
University of Vienna,
Oskar Morgenstern Platz 1, Lecture room 7 (HS7, 1st Floor).
16.45-18:45
University of Groningen
Abstract:
How many connected graphs have a prescribed degree sequence? This classical combinatorial question turns out to admit a natural probabilistic approach.
In joint ongoing work with Sasha Bell and Remco van der Hofstad, we derive asymptotic formulas for the number of connected graphs with a given degree sequence. Our approach is an example of the probabilistic method. Concretely, we construct a random graph in which (an approximation of) the prescribed degree sequence appears with high probability inside a large connected component. This perspective allows us to translate questions about enumeration into probabilistic statements about random graphs.
Along the way, I will discuss several key probabilistic tools, including the configuration model, branching process approximations, and local weak convergence, and explain how they combine to yield asymptotic counting results.
University of Vienna
Abstract:
May 19 2026
ISTA, Raiffeisen Lecture Hall
15:30-18:00
Hebrew University of Jerusalem
Abstract:
June 2 2026
University of Vienna,
Oskar Morgenstern Platz 1, Lecture room 8 (HS8, 1st Floor).
16.45-18:45
EPFL
Abstract:
20 October 2026
Venue:
Abstract:
3 November 2026
Venue:
Abstract:
17 November 2026
Venue:
Abstract:
1 December 2026
Venue:
Abstract:
15 December 2026
Venue:
Abstract:
19 January 2027
Venue:
Abstract: