Graphs and Matroids Seminar - Richard Lang

Title: Minimum degree conditions for Hamilton cycles in hypergrahs

Abstract:

A classic result of Dirac states that a graph in which every vertex is connected to at least half of the other vertices contains a Hamilton cycle. How can we generalize Dirac's theorem to hypergraphs?

In the past two decades a lot progress has been made in tackling this problem, but many open questions remain. In this talk, I will give an introduction to the topic and present some recent advances.