A combinatorial characterization of the testable graph properties: it's all about regularity

A common thread in recent results concerning the testing of dense graphs is the use of Szemerédi's regularity lemma. In this paper we show that in some sense this is not a coincidence. Our first result is that the property defined by having any given Szemerédi-partition is testable with a constant number of queries. Our second and main result is a purely combinatorial characterization of the graph properties that are testable with a constant number of queries. This characterization (roughly) says that a graph property P can be tested with a constant number of queries if and only if testing P can be reduced to testing the property of satisfying one of finitely many Szemerédi-partitions. This means that in some sense, testing for Szemerédi-partitions is as hard as testing any testable graph property. We thus resolve one of the main open problems in the area of property-testing, which was raised in the 1996 paper of Goldreich, Goldwasser and Ron [25] that initiated the study of graph property-testing. This characterization also gives an intuitive explanation as to what makes a graph property testable.

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

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

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

[4]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

[6]  M. Simonovits,et al.  Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

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

[8]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

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

[10]  W. T. Gowers,et al.  Lower bounds of tower type for Szemerédi's uniformity lemma , 1997 .

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

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

[13]  Alan M. Frieze,et al.  Quick Approximation to Matrices and Applications , 1999, Comb..

[14]  吕维柏.  The Challenge in New Century , 1999 .

[15]  Noga Alon,et al.  Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[16]  Artur Czumaj,et al.  Property Testing in Computational Geometry , 2000, ESA.

[17]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

[18]  Ilan Newman.  Testing of function that have small width branching programs , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[19]  Eldar Fischer,et al.  Large K r -free subgraphs in K s -free graphs and some other Ramsey-type problems , 2005 .

[20]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[21]  Sanguthevar Rajasekaran.  Handbook of randomized computing , 2001 .

[22]  Eldar Fischer,et al.  Testing graphs for colorable properties , 2001, SODA '01.

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

[24]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[25]  Dana Ron,et al.  Testing the diameter of graphs , 1999, RANDOM-APPROX.

[26]  D. Ron,et al.  Testing membership in parenthesis languages , 2003, Random Struct. Algorithms.

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

[28]  Guy Kindler,et al.  Testing juntas , 2002, J. Comput. Syst. Sci..

[29]  Gheorghe Paun,et al.  Current Trends in Theoretical Computer Science: The Challenge of the New Century , 2004 .

[30]  Ronitt Rubinfeld,et al.  Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions , 2008, Random Struct. Algorithms.

[31]  Noga Alon,et al.  Testing of Clustering , 2003, SIAM J. Discret. Math..

[32]  Eldar Fischer.  The difficulty of testing for isomorphism against a graph that is given in advance , 2004, STOC '04.

[33]  Jirí Sgall,et al.  Functions that have read-twice constant width branching programs are not necessarily testable , 2004, Random Struct. Algorithms.

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

[35]  Eli Ben-Sasson,et al.  Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..

[36]  Oded Goldreich,et al.  Contemplations on Testing Graph Properties , 2005, Sublinear Algorithms.

[37]  Artur Czumaj,et al.  Abstract Combinatorial Programs and Efficient Property Testers , 2005, SIAM J. Comput..

[38]  Miklos Santha,et al.  Efficient testing of groups , 2005, STOC '05.

[39]  Eldar Fischer,et al.  Testing versus estimation of graph properties , 2005, STOC '05.

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

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

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

[43]  Noga Alon,et al.  A separation theorem in property testing , 2008, Comb..

[44]  Ronitt Rubinfeld,et al.  Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions , 2008, Random Struct. Algorithms.

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