Graphs and Matroids Seminar - Richard Lang

Title: Spanning cycles in Hypergraphs

*Please note the room change from the previous week

Abstract:

A long time ago, Lehel asked whether the vertex set of every complete graph, whose edges have been coloured red and blue, can be partitioned into a red and a blue cycle. This was answered in the affirmative by Bessy and Tomassé, after preliminary work of Łuczak, Rödl and Szemerédi. In this talk, I will present some of the recent progress towards a hypergraph analogue of Lehel's conjecture.