University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > The threshold for the square of a Hamilton cycle

The threshold for the square of a Hamilton cycle

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

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

We will talk about a recent result of Jeff Kahn, Bhargav Narayanan, and myself stating that the threshold for the random graph G(n,p) to contain the square of a Hamilton cycle is 1/sqrt n, resolving a conjecture of Kühn and Osthus from 2012. The proof idea is motivated by the recent work of Frankston and the three aforementioned authors on a conjecture of Talagrand—“a fractional version of Kahn-Kalai expectation threshold conjecture.”

__

Meeting ID: 830 2268 5017 Passcode: 101833

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.