BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Spanning regular subgraphs of random graphs: sharp thresholds  - M
 aksim Zhukovskii (Sheffield)
DTSTART:20230302T143000Z
DTEND:20230302T153000Z
UID:TALK196762@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION:Given a constant d and a sequence of d-regular graphs F_n\, wh
 at is the\nthreshold probability for containing a spanning subgraph isomor
 phic to F_n?\nIn the talk\, a fairly optimal answer to this question will 
 be presented. In\nparticular\, it proves the conjecture of Kahn\, Narayana
 n and Park on a sharp\nthreshold for the containment of a square of a Hami
 lton cycle. It also\nimplies sharp thresholds for (asymptotically) almost 
 all d-regular graphs\nF_n.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR