BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-75-489
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Regular partitions of graphs.
        TYPE:: Technical Report
      AUTHOR:: Szemeredi, Endre
        DATE:: April 1975
       PAGES:: 9
    ABSTRACT:: A crucial lemma in recent work of the author (showing that
               k-term arithmetic progression-free sets of integers must have
               density zero) stated (approximately) that any large bipartite
               graph can be decomposed into relatively few "nearly regular"
               bipartite subgraphs. In this note we generalize this result
               to arbitrary graphs, at the same time strengthening and
               simplifying the original bipartite result.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-75-489