Every Monotone 3-Graph Property is Testable

Recently Alon and Shapira [Every monotone graph property is testable, New York, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, ACM Press, 2005, pp. 128-137] have established that every monotone graph property is testable. They raised the question whether their results can be extended to hypergraphs. The aim of this paper is to address this problem. Based on the recent regularity lemma of Ro¨dl and Schacht [Regular partitions of hypergraphs, Combin. Probab. Comput., to appear], we prove that any monotone property of 3-uniform hypergraphs is testable answering in part the question of Alon and Shapira. Our approach is similar to the one developed by Alon and Shapira for graphs. We believe that based on the general version of the hypergraph regularity lemma the proof presented in this article extends to $k$-uniform hypergraphs.

[1]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[2]  V. Rödl,et al.  On graphs with small subgraphs of large chromatic number , 1985, Graphs Comb..

[3]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[4]  V. Rödl,et al.  Extremal problems on set systems , 2002 .

[5]  Vojtech Rödl,et al.  Regularity Lemma for k‐uniform hypergraphs , 2004, Random Struct. Algorithms.

[6]  B. Bollobás,et al.  Extremal Graphs without Large Forbidden Subgraphs , 1978 .

[7]  Noga Alon,et al.  Every monotone graph property is testable , 2005, STOC '05.

[8]  László Lovász,et al.  Graph limits and parameter testing , 2006, STOC '06.

[9]  W. T. Gowers,et al.  Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.

[10]  RodlVojtech,et al.  Regular Partitions of Hypergraphs , 2007 .

[11]  V. Rödl,et al.  The counting lemma for regular k-uniform hypergraphs , 2006 .

[12]  Noga Alon.  Testing subgraphs in large graphs , 2002, Random Struct. Algorithms.

[13]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[14]  Dana Ron,et al.  Property Testing , 2000 .

[15]  Noga Alon,et al.  A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[16]  Artur Czumaj,et al.  Testing hypergraph colorability , 2005, Theor. Comput. Sci..

[17]  Vojtech Rödl,et al.  Regularity properties for triple systems , 2003, Random Struct. Algorithms.

[18]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[19]  Terence Tao.  A variant of the hypergraph removal lemma , 2006, J. Comb. Theory, Ser. A.

[20]  Noga Alon,et al.  Testing k-colorability , 2002, SIAM J. Discret. Math..