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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Optimally packing Hamilton cycles in random digraphs

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 .

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:

Note that ex-directory lists are not shown.

Other lists

Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Webinar - registration info to follow James Dyson Building Seminar Room - Department of Engineering.

Other talks

Human monogamy in mammalian context Diasporic Divas: Performing Race, Gender, and Sexuality from the 18th Century to Today A Few Days in Patagonia - the Deep South How bubble acoustics can help in three apocalypses Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa Title to be confirmed
 

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