Geometric Functional Analysis and Probability Seminar

Date:

Thursday

January

2026

Lecture / Seminar

Time: 13:30-14:30

Title: Optimally packing Hamilton cycles in random directed digraphs

Location: Jacob Ziskind Building

Lecturer: Adva Mond

Organizer: Department of Mathematics

Contact: hany.kochavi@weizmann.ac.il

Details: King's College

Abstract: At most how many edge-disjoint Hamilton cycles does a given directed graph conta ... Read more At 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 that in the random directed graph D(n,p) one can pack precisely this many edge-disjoint Hamilton cycles, with high probability, given that p is at least the Hamiltonicity threshold, up to a polylog factor. Based on a joint work with Asaf Ferber.

Close abstract