University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Degree conditions for spanning hypergraphs

Degree conditions for spanning hypergraphs

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

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.

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.