Every monotone graph property is testable

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 128-137

  Alon, Noga ^a   Shapira, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Monotone Properties; Property Testing; Regularity Lemma

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; QUERY LANGUAGES; SET THEORY;

MONOTONE PROPERTIES; PROPERTY TESTING; QUERY COMPLEXITY; REGULARITY LEMMA;

GRAPH THEORY;

EID: 34848872557     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060611     Document Type: Conference Paper

References (36)

1. nd IEEE FOCS, IEEE (2001), 434-441.
2. rd IEEE FOCS, Pittsburgh, IEEE (1992), 473-481.
3. Also: J. of Algorithms 16 (1994), 80-109.
4. th FOCS, New York, NY, IEEE (1999), 656-666.
5. Also: Combinatorica 20 (2000), 451-476.
6. th FOCS, New York, NY, IEEE (1999), 645-655.
7. Also: SIAM J. on Computing 30 (2001), 1842-1862.
8. N. Alon and M. Krivelevich, Testing k-colorability, SIAM J. Discrete Math., 15 (2002), 211-227.
9. th Annual ACM-SIAM SODA, ACM Press (2002), 645-654.
10. Also: Journal of Algorithms, 47 (2003), 87-103.
11. th Annual Symp. on Theory of Computing (STOC), San Diego, California, 2003, 700-709.
12. N. Alon and A. Shapira, Extremal graphs, recursive functions and a separation theorem in property-testing, manuscript.
13. N. Alon and J. H. Spencer, The probabilistic method, Second Edition, Wiley, New York, 2000.
14. J. Balogh, B. Bollobás and D. Weinreich, Measures on monotone properties of graphs, Discrete Applied Mathematics, to appear.
15. D. Eichhorn and D. Mubayi, Edge-coloring cliques with many colors on subcliques, Combinatorica 20 (2000), 441-444.
16. P. Erdos, P. Frankl and V. Rödl, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs Combin. 2 (1986) 113-121.
17. P. Erdos and A. Gyárfás, A variant of the classical Ramsey problem, Combinatorica 17 (1997), 459-467.
18. th SODA (2001), 873-882.
19. E. Fischer, The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97-126.
20. E. Fischer, I. Newman and J. Sgall, Functions that have read-twice constant width branching programs are not necessarily testable, Random Structures and Algorithms, in press.
21. E. Friedgut and G. Kalai, Every monotone graph property has a sharp threshold. Proc. Amer. Math. Soc. 124 (1996), 2993-3002.
22. O. Goldreich, Combinatorial property testing - a survey, In: Randomization Methods in Algorithm Design (P. Pardalos, S. Rajasekaran and J. Rolim eds.), AMS-DIMACS (1998), 45-60.
23. th Annual IEEE FOCS, (1996), 339-348.
24. Also, JACM 45(4): 653-750 (1998).
25. nd IEEE FOCS, IEEE (2001), 460-469.
26. Also, Random Structures and Algorithms, 23(1):23-57, 2003.
27. R. L. Graham, B. L. Rothschild and J. H. Spencer, Ramsey Theory, Second Edition, Wiley, New York, 1990.
28. W. T. Cowers, Hypergraph regularity and the multidimensional Szemerédi theorem, manuscript.
29. J. Komlós and M. Simonovits, Szemerédi's Regularity Lemma and its applications in graph theory. In: Combinatorics, Paul Erdös is Eighty, Vol II (D. Miklós, V. T. Sós, T. Szönyi eds.), János Bolyai Math. Soc., Budapest (1996), 295-352.
30. th FOCS (2000), 251-258.
31. B. Nagle, V. Rödl and M. Schacht, The counting lemma for regular k-uniform hypegraphs, manuscript.
32. V. Rödl and R. Duke, On graphs with small subgraphs of large chromatic number, Graphs and Combinatorics 1 (1985), 91-96.
33. V. Rödl and J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures and Algorithms, 25 (2004), 1-42.
34. D. Ron, Property testing, in: P. M. Pardalos, S. Rajasekaran, J. Reif and J. D. P. Rolim, editors, Handbook of Randomized Computing, Vol. II, Kluwer Academic Publishers, 2001, 597-649.
35. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. on Computing 25 (1996), 252-271.
36. E. Szemerédi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.), 1978, 399-401.