When: Sunday, March 26,
10am
Where: Schreiber 309
Speaker: Maksim Zhukovskii,
University of Sheffield
Title:
Spanning Regular Subgraphs of Random Graphs: Sharp Thresholds
Given a constant $d$ and a sequence of $d$-regular 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 implies sharp thresholds for (asymptotically) almost all $d$-regular graphs $F_n$.