IMI Interdisciplinary Mathematics InstituteCollege of Arts and Sciences

NSF-CBMS Conference on Additive Combinatorics from a Geometric Viewpoint

Jozsef Solymosi
University of British Columbia

Dense graphs. Regularity and regularity lemmas for graphs and hypergraphs

  • May 23, 2018
  • 11:30 a.m.
  • LeConte 412

When one uses dense graphs for modelling problems in additive combinatorics, then one of the most powerful tools is Szemeredi's Regularity Lemma. An even more powerful recent result is the Removal Lemma for hypergraphs. In this lecture we introduce the basic definitions and state various forms of the theorems.

© Interdisciplinary Mathematics Institute | The University of South Carolina Board of Trustees | Webmaster