Advances in the Regularity Method

  • Yoshiharu Kohayakawa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)


A beautiful result of Szemerédi on the asymptotic structure of graphs is his regularity lemma. Roughly speaking, his result tells us that any large graph may be written as a union of a bounded number of induced, random looking bipartite graphs (the so called ε-regular pairs).

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Yoshiharu Kohayakawa
    • 1
  1. 1.Instituto de Matemática e EstatísticaUniversidade de São PauloSão PauloBrazil

Personalised recommendations