46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) (2005)

Pittsburgh, Pennsylvania, USA

Oct. 23, 2005 to Oct. 25, 2005

ISBN: 0-7695-2468-0

pp: 439-448

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.17

P.E. Haxell , University of Waterloo

B. Nagle , University of Nevada

V. Rodl , Emory University

ABSTRACT

<p>Extending the Szemer?edi Regularity Lemma for graphs, P. Frankl and the third author [11] established a 3-graph Regularity Lemma guaranteeing that all large triple systems admit partitions of their edge sets into constantlymany classes where most classes consist of regularly distributed edges. Many applications of this lemma require a companion Counting Lemma [26] allowing one to estimate the number of copies of K_k ^{(3)} in a "dense and regular" environment created by the 3-graph Regularity Lemma. Combined applications of these lemmas are known as the 3- graph Regularity Method. In this paper, we provide an algorithmic version of the 3-graph Regularity Lemma which, as we show, is compatible with a Counting Lemma. We also discuss some applications.</p> <p>For general k-uniform hypergraphs, Regularity and Counting Lemmas were recently established by Gowers [16] and by Nagle, R?odl, Schacht, and Skokan [27, 35]. We believe the arguments here provide a basis toward a general algorithmic hypergraph regularity method.</p>

INDEX TERMS

null

CITATION

P. Haxell, V. Rodl and B. Nagle, "An Algorithmic Version of the Hypergraph Regularity Method,"

*46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)(FOCS)*, Pittsburgh, Pennsylvania, USA, 2005, pp. 439-448.

doi:10.1109/SFCS.2005.17

CITATIONS