University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Perfect matchings in random sparsifications of Dirac hypergraphs

## Perfect matchings in random sparsifications of Dirac hypergraphsAdd to your list(s) Download to your calendar using vCal - Vincent Pfenniger, Birmingham
- Thursday 23 March 2023, 15:00-16:00
- Poynting Small LT.
If you have a question about this talk, please contact Dr Richard Mycroft. We show that, for k >= 3 and n divisible by k, if a k-uniform hypergraph H on n vertices has large enough minimum (k-1)-degree to guarantee a perfect matching, then asymptotically almost surely a p-random subhypergraph of H also contains a perfect matching, provided that p > C log n / n^{k-1}. Our result strengthens Johansson, Kahn, and Vu’s seminal solution to Shamir’s problem and can be viewed as a ‘robust’ version of a hypergraph Dirac-type result by Rödl, Ruciński, and Szemerédi. This talk is part of the Combinatorics and Probability seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsType the title of a new list here Topology and Dynamics seminar Data Science and Computational Statistics Seminar## Other talks[Friday seminar]: Irradiated brown dwarfs in the desert Signatures of structural criticality and universality in the cellular anatomy of the brain Towards Efficient and Robust Data-Driven Optimization Statistical Physics Perturbation Theory Applied to the Ising Model on the Square, Cubic and Hypercubic Lattices The percolating cluster is invisible to image recognition with deep learning |