University of Cambridge > Talks.cam > Combinatorics Seminar > Spanning regular subgraphs of random graphs: sharp thresholds

  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

Spanning regular subgraphs of random graphs: sharp thresholds

Download to your calendar using vCal

  • UserMaksim Zhukovskii (Sheffield)
  • ClockThursday 02 March 2023, 14:30-15:30
  • HouseMR12.

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

Given a constant d and a sequence of d-regular graphs F_n, what is the threshold probability for containing a spanning subgraph isomorphic to F_n? In the talk, a fairly optimal answer to this question will be presented. In particular, it proves the conjecture of Kahn, Narayanan and Park on a sharp threshold for the containment of a square of a Hamilton cycle. It also implies sharp thresholds for (asymptotically) almost all d-regular graphs F_n.

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

Cambridge University Geographical Society (CUGS) talks CUES https://us02web.zoom.us/meeting/register/tZEkf—oqD0oGtyfB2MIlB4iCmaulP7DpUkG

Other talks

Coming soon A scientists guide to the art of radiation therapy and Neurosurgery for the oncologist Zooming in on the assembly of galaxies in the early Universe The United States of America at 250: Reflections on the Past, Present and Future of Independence Title to be confirmed Title to be confirmed
 

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