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

Spanning regular subgraphs of random graphs: sharp thresholds

Add to your list(s) 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 ibl10.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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