Optimally packing Hamilton cycles in random digraphs

Add to your list(s) Download to your calendar using vCal

• Adva Mond (King's)
• Thursday 07 November 2024, 14:30-15:30
• MR12.

If you have a question about this talk, please contact ibl10.

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 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 joint work with Asaf Ferber.)

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.