Colloquium Mathematics - Maksim Zhukovskii, University of Sheffield

Title: Spanning regular subgraphs of random graphs: sharp thresholds

Abstract:

Given a constant d and a sequence of d-regular graphs F_n on n vertices, what is the threshold probability for containing a spanning subgraph isomorphic to F_n by a binomial random graph? In the talk, a fairly optimal answer to this question will be presented. In particular, it implies sharp thresholds for (asymptotically) almost all d-regular graphs F_n.