Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, March 04, 2014, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Peter Allen (London School of Economics)

Tight cycles and regular slices in dense hypergraphs

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login