Degree conditions for spanning hypergraphs

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

• Matias Pavez-Signe, Birmingham
• Thursday 18 November 2021, 15:00-16:00
• LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071.

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

A central problem in extremal graph theory is the study of degree conditions that force a graph G to contain a copy of some large or even spanning subgraph. Famous examples in this area include Dirac’s theorem on Hamilton cycles, the Bollobás conjecture on spanning trees, the Pósa-Seymour conjecture on powers of Hamilton cycles, and the Bandwidth conjecture of Bollobás and Komlós.

In this talk, we will describe some recent results trying to generalise this problem to the setting of k-uniform hypergraphs. In particular, we will show a hypergraph version of Bollobás’s conjecture and progress to a hypergraph version of the Pósa-Seymour conjecture.

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

This talk is included in these lists:

• Combinatorics and Probability seminar
• LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071
• School of Mathematics events

Note that ex-directory lists are not shown.