Property testing in hypergraphs and the removal lemma

Property testers are efficient, randomized algorithms which recognize if an input graph (or other combinatorial structure) satisfies a given property or if it is "far" from exhibiting it.Generalizing several earlier results, Alon and Shapira showed thathereditary graph properties are testable (with one-sided error). In this paper we prove the analogous result for hypergraphs.This result is an immediate consequence of a (hyper)graph theoretic statement, which is an extension of the so-called removal lemma. The proof of this generalization relies on the regularity method for hypergraphs.

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

[2]  Yoshiharu Kohayakawa,et al.  Efficient testing of hypergraphs: (Extended abstract) , 2002 .

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

[4]  Noga Alon,et al.  Homomorphisms in Graph Property Testing , 2006 .

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

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

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

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

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

[10]  Vojtech Rödl,et al.  Every Monotone 3-Graph Property is Testable , 2005, SIAM J. Discret. Math..

[11]  Noga Alon,et al.  Additive approximation for edge-deletion problems , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

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

[13]  Vojtech Rödl,et al.  The counting lemma for regular k‐uniform hypergraphs , 2006, Random Struct. Algorithms.

[14]  Vojtech Rödl,et al.  An algorithmic version of the hypergraph regularity method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[15]  Vojtech Rödl,et al.  Applications of the regularity lemma for uniform hypergraphs , 2006, Random Struct. Algorithms.

[16]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[17]  László Lovász,et al.  Graph limits and testing hereditary graph properties , 2005 .

[18]  Yoshiharu Kohayakawa,et al.  Efficient Testing of Hypergraphs , 2002, ICALP.

[19]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

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

[21]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[22]  Vojtech Rödl,et al.  The Algorithmic Aspects of the Regularity Lemma , 1994, J. Algorithms.

[23]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[24]  Vojtech Rödl,et al.  The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..

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

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

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

[28]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

[29]  W. G. Brown,et al.  On the existence of triangulated spheres in 3-graphs, and related problems , 1973 .

[30]  P. Erdijs.  ON SOME EXTREMAL PROBLEMS ON r-GRAPHS , 1971 .

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

[32]  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).

[33]  Vojtech Rödl,et al.  Generalizations of the removal lemma , 2009, Comb..

[34]  Paul Erdös,et al.  On some extremal problems on r-graphs , 1971, Discret. Math..

[35]  P. Erdös.  Problems and Results on Graphs and Hypergraphs: Similarities and Differences , 1990 .

[36]  Béla Bollobás.  Advances in graph theory , 1978 .

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

[38]  N. Alon,et al.  testing of large graphs , 2000 .

[39]  Vojtech Rödl,et al.  Every Monotone 3-Graph Property is Testable , 2007, SIAM J. Discret. Math..

[40]  Vojtech Rödl,et al.  Extremal problems on set systems , 2002, Random Struct. Algorithms.