Tight cycles and regular slices in dense hypergraphs
Graphs, Hypergraphs, and Computing
28 January 15:30 - 16:30
Peter Allen - The London School of Economics and Political Science (LSE)
We describe a general approach to the strong hypergraph regularity lemma, which we call 'regular slices', which avoids many of the usual technical complications and retains the features one would like to use in extremal hypergraph theory. This talk will avoid painful technical details in so far as that is possible and focus on an application, proving a hypergraph extension of the Erdos-Gallai theorem.
This is joint work with Julia Boettcher, Oliver Cooley and Richard Mycroft.
Magnus M. Halldorsson
Adam Mickiewicz University
Technical University of Denmark, DTU