Csaba Bela: Harnessing regularity without the Regularity lemma

Absztrakt:
The Regularity lemma of Szemerédi is among the most powerful
tools in graph theory. It also has many applications in
other areas, such as number theory, algebra, geometry, and
computer science.
As it cannot be used for graphs of "practical" size, several
weaker versions arose, which can replace the lemma in certain
cases.
In this talk we present new decomposition methods that can be
used for some graph embedding problems. Common feature of these
decompositions that the edge set of the graph is partitioned
into pseudorandom subgraphs. Some applications will also be
given.

The zoom link  is:
https://zoom.us/j/2961946869