The following credit lecture program is a production of the Department of Independent Study and radio station KUOM at the University of Minnesota. Listneers may obtain University of Minnesota credit by following these programs and completing course requirements by mail. Details will be given at the end of the program. The course you are about to...
Creator:
University of Minnesota. Radio Station KUOM
Created:
1985-10-12
Contributed By:
University of Minnesota Libraries, University Archives.
Szemeredi's regularity lemma is a basic structural result that gives a useful description of arbitrary large dense graphs, of importance in graph theory and theoretical computer science. There are now many variants of this lemma that apply to other graph or graph-like models. In this talk we discuss two of these. The first is the arithmetic regu...
Creator:
Tao, Terence (University of California, Los Angeles)
Created:
2012-12-01
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.