Spanning regular subgraphs of random graphs: sharp thresholds
Add to your list(s)
Download to your calendar using vCal
 Maksim Zhukovskii (Sheffield)
 Thursday 02 March 2023, 14:3015:30
 MR12.
If you have a question about this talk, please contact ibl10.
Given a constant d and a sequence of dregular graphs F_n, what is the
threshold probability for containing a spanning subgraph isomorphic to F_n?
In the talk, a fairly optimal answer to this question will be presented. In
particular, it proves the conjecture of Kahn, Narayanan and Park on a sharp
threshold for the containment of a square of a Hamilton cycle. It also
implies sharp thresholds for (asymptotically) almost all dregular graphs
F_n.
This talk is part of the Combinatorics Seminar series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
