Discrete Mathematics and Optimization Seminar
Feb. 2nd, 2009
On the Regularity Method
Gabor N. Sarkozy
Computer and Automation Research Institute of the Hungarian Academy of Sciences and Worcester Polytechnic Institute
The Regularity method based on the Regularity Lemma and the Blow-up Lemma has been a very successful method in the theory of dense graphs and hypergraphs. In this talk we overview the history and the basics of the method. We show some results that we were able to obtain with this method. In particular we will focus on one problem where the method has been productive, namely finding various kinds of cycles in hypergraphs.

Co-authors on this work included Paul Dorbec, Sylvain Gravier, Andras Gyarfas, Jeno Lehel, Richard Schelp and Endre Szemeredi.