Szemerédi regularity lemma and its applications (3/3)

Datum

30.05.2017

Zeit

15:00 - 16:00

Sprecher

Jan Hladky

Zugehörigkeit

TU Dresden, Institut für Geometrie

Sprache

en

Hauptthema

Mathematik

Andere Themen

Mathematik

Host

Prof. Dr. A. Thom

Beschreibung

This series of lectures aims at Master‘s and PhD students in mathematics and offers a first glimpse into topics which are not routinely taught in our MSc/PhD programme. The emphasis is to introduce new concepts and techniques, and not to present full mathematical details. In 1978, Szemerédi published a three page paper "Regular partitions of graphs". The result of that paper, now known as the Regularity lemma, became one of the most important tools in graph theory, with deep connections to other parts of combinatorics, number theory, and to theoretical computer science. The first lecture will cover the concept of graph quasirandomness and the Regularity lemma. We shall also derive the Removal lemma. In the second lecture, we will give applications to extremal graph theory, property testing, and number theory. In the third lecture, we shall use the Regularity lemma to construct graphons which are the key objects of the theory of limits of dense graphs.

Links

• Graduate Lectures in Mathematics

Letztmalig verändert: 03.05.2017, 16:43:30