2016
Dec
19

# Special logic seminar - Elad Levi "Algebraic regularity lemma for hypergraphs"

10:00am to 12:00pm

## Location:

Sprinzak 101

Speaker: Elad Levi
Algebraic regularity lemma for hypergraphs
Abstract: Szemer´edi’s Regularity Lemma is a fundamental tool in graph theory. It states that for every large enough graph, the set of vertices has a partition A1,..,Ak, such that for almost every two subsets Ai,Aj the induced bipartite graph on (Ai,Aj) is regular, i.e. similar to a random bipartite graph up to a given error.