Advanced search
Found 1 essay matching the above criteria.
-
1. Szémeredi's regularity lemma and its applications in combinatorics
University essay from Institutionen för matematik och matematisk statistikAbstract : Szemerédi’s regularity lemma is a deep result in graph theory with applications in many different areas of mathematics. The lemma says that any graph can be approximated by the union of a bounded num- ber of random-like bipartite graphs and this can be used to extract the underlying structure of the graph. READ MORE
Result pages:
1