BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY: Optimally packing Hamilton cycles in random digraphs - Adva Mond 
 (King's)
DTSTART:20241107T143000Z
DTEND:20241107T153000Z
UID:TALK224218@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION: \nAt most how many edge-disjoint Hamilton cycles does a given
  directed graph contain? It is easy to see that one cannot pack more than 
 the minimum in-degree or the minimum out-degree of the digraph. We show th
 at in the random directed graph one can pack precisely this many edge-disj
 oint Hamilton cycles\, with high probability\, given that p is at least th
 e Hamiltonicity threshold\, up to a polylog factor.\n(Based on joint work 
 with Asaf Ferber.)\n 
LOCATION:MR12
END:VEVENT
END:VCALENDAR