Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, March 04, 2014, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Peter Allen (London School of Economics)
I will describe an approach to hypergraph regularity which maintains the useful features for extremal combinatorics of the Strong Hypergraph Regularity Lemma, but whose output is a weighted hypergraph (rather than a weighted multi-complex). This approach substantially simplifies several results in extremal hypergraph theory, permitting regularity proofs in the style of those seen in extremal graph theory. I will avoid painful technical details where possible, and give an example application in the form of a hypergraph extension of the Erdos-Gallai theorem.
This is joint work with Julia Boettcher, Oliver Cooley and Richard Mycroft.
Automatic MiSe System Software Version 1.4803M | admin login