COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

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

## Spanning regular subgraphs of random graphs: sharp thresholdsAdd to your list(s) Download to your calendar using vCal - Maksim Zhukovskii (Sheffield)
- Thursday 02 March 2023, 14:30-15:30
- MR12.
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. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsAnnual Race Equality Lecture stem cell Explore Islam Week 2014 (EIW)## Other talksCANCELLED DUE TO UCU STRIKES: A Great Ape Dictionary: now what? Weak localization in radiative transfer of acoustic waves in randomly-fluctuating half-space, slab, and box. Simplified Earth-abundant metal catalysis, C–H activation and transborylation Scientific Uses of Automatic Differentiation How do cells acquire drug resistance mutations? Grand Rounds - Cardiology |