On the Testability of Graph Partition Properties

Authors Yonatan Nakar, Dana Ron

Thumbnail PDF


  • Filesize: 0.5 MB
  • 13 pages

Document Identifiers

Author Details

Yonatan Nakar
  • Tel Aviv University, Tel Aviv, Israel
Dana Ron
  • Tel Aviv University, Tel Aviv, Israel

Cite AsGet BibTex

Yonatan Nakar and Dana Ron. On the Testability of Graph Partition Properties. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 53:1-53:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


In this work we study the testability of a family of graph partition properties that generalizes a family previously studied by Goldreich, Goldwasser, and Ron (Journal of the ACM, 1998 ). While the family studied by Goldreich, Goldwasser, and Ron includes a variety of natural properties, such as k-colorability and containing a large cut, it does not include other properties of interest, such as split graphs, and more generally (p,q)-colorable graphs. The generalization we consider allows us to impose constraints on the edge-densities within and between parts (relative to the sizes of the parts). We denote the family studied in this work by GPP. We first show that all properties in GPP have a testing algorithm whose query complexity is polynomial in 1/epsilon, where epsilon is the given proximity parameter (and there is no dependence on the size of the graph). As the testing algorithm has two-sided error, we next address the question of which properties in GPP can be tested with one-sided error and query complexity polynomial in 1/epsilon. We answer this question by establishing a characterization result. Namely, we define a subfamily GPP_{0,1} of GPP and show that a property P in GPP is testable by a one-sided error algorithm that has query complexity poly(1/epsilon) if and only if P in GPP_{0,1}.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Graph Partition Properties


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Noga Alon. Testing subgraphs in large graphs. Random Structures &Algorithms, 21(3-4):359-370, 2002. Google Scholar
  2. Noga Alon, Eldar Fischer, Michael Krivelevich, and Mario Szegedy. Efficient testing of large graphs. Combinatorica, 20(4):451-476, 2000. Google Scholar
  3. Noga Alon, Eldar Fischer, Ilan Newman, and Asaf Shapira. A combinatorial characterization of the testable graph properties: it’s all about regularity. SIAM Journal on Computing, 39(1):143-167, 2009. Google Scholar
  4. Noga Alon and Jacob Fox. Easily testable graph properties. Combinatorics, Probability and Computing, 24(4):646-657, 2015. Google Scholar
  5. Noga Alon and Michael Krivelevich. Testing k-colorability. SIAM Journal on Discrete Mathematics, 15(2):211-227, 2002. Google Scholar
  6. Noga Alon and Asaf Shapira. Testing subgraphs in directed graphs. Journal of Computer and System Sciences, 69(3):354-382, 2004. Google Scholar
  7. Noga Alon and Asaf Shapira. A characterization of easily testable induced subgraphs. Combinatorics, Probability and Computing, 15(6):791-805, 2006. Google Scholar
  8. Noga Alon and Asaf Shapira. A characterization of the (natural) graph properties testable with one-sided error. SIAM Journal on Computing, 37(6):1703-1727, 2008. Google Scholar
  9. Christian Borgs, Jennifer Chayes, László Lovász, Vera T Sós, Balázs Szegedy, and Katalin Vesztergombi. Graph limits and parameter testing. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 261-270. ACM, 2006. Google Scholar
  10. David Conlon and Jacob Fox. Graph removal lemmas. Surveys in combinatorics, 1(2):3, 2013. Google Scholar
  11. Lior Gishboliner and Asaf Shapira. Removal lemmas with polynomial bounds. arXiv preprint arXiv:1611.10315, 2016. Google Scholar
  12. Oded Goldreich, Shari Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM (JACM), 45(4):653-750, 1998. Google Scholar
  13. Oded Goldreich and Luca Trevisan. Three theorems regarding testing graph properties. Random Structures &Algorithms, 23(1):23-57, 2003. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail