University of Cambridge > Talks.cam > Combinatorics Seminar >  Optimally packing Hamilton cycles in random digraphs

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Optimally packing Hamilton cycles in random digraphs

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

  • UserAdva Mond (King's)
  • ClockThursday 07 November 2024, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Leverhulme CFI Cancer Genetic Epidemiology Seminar Series Peterhouse Theory Group

Other talks

Echoes on the map: unveiling the auditory history of late Ottoman Istanbul through digital cartography Fred Simmons: Topic TBA Materialising ideas, idealising beings, and being material: animals in Bronze Age Scandinavian Southern Tradition rock art. A Slippery Signifier: Sea Ice in the Norwegian National Imaginary Decoding our Humanity Wearable electrocardiography: from Holter to handheld devices
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity