Testing Subgraphs in Large Graphs

Random Structures and Algorithms

Volumn 21, Issue 3-4, 2002, Pages 359-370

  Alon, Noga ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036437231     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10056     Document Type: Conference Paper

References (26)

1. N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The algorithmic aspects of the Regularity Lemma, Proc. 33rd IEEE FOCS, IEEE, Pittsburgh, 1992, pp. 473-481; also J Alg 16 (1994), 80-109.
2. N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The algorithmic aspects of the Regularity Lemma, Proc. 33rd IEEE FOCS, IEEE, Pittsburgh, 1992, pp. 473-481; also J Alg 16 (1994), 80-109.
3. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Efficient testing of large graphs, Proc 40th Annu Symp Foundations of Computer Science (FOCS), IEEE, New York, 1999, 656-666; also Combinatorica 20 (2000), 451-476.
4. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Efficient testing of large graphs, Proc 40th Annu Symp Foundations of Computer Science (FOCS), IEEE, New York, 1999, 656-666; also Combinatorica 20 (2000), 451-476.
5. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy, Regular languages are testable with a constant number of queries, Proc 40th Annu Symp Foundations of Computer Science (FOCS), IEEE, New York, 1999, 645-655; also SIAM J Comput 30 (2001), 1842-1862.
6. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy, Regular languages are testable with a constant number of queries, Proc 40th Annu Symp Foundations of Computer Science (FOCS), IEEE, New York, 1999, 645-655; also SIAM J Comput 30 (2001), 1842-1862.
7. N. Alon and M. Krivelevich, Testing k-colorability, SIAM J Discrete Math 15 (2002), 211-227.
8. F. A. Behrend, On sets of integers which contain no three terms in arithmetic progression, Proc Nat Acad Sci USA 32 (1946), 331-332.
9. B. Bollobás, P. Erdos, M. Simonovits, and E. Szemerédi, Extremal graphs without large forbidden subgraphs, Ann Discrete Math 3 (1978), 29-41.
10. J. Bourgain, On triples in arithmetic progressions, Geom Fund Anal 9 (1999), 968-984.
11. A. Czumaj and C. Sohler, Testing hypergraph coloring, Proc ICALP, Heraklion, Crete, 2001, pp. 493-505.
12. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), 175-220.
13. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky, Testing monotonicity, Combinatorica 20 (2000), 301-337.
14. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, Proc 37th Annu IEEE FOCS, Burlington, Vermont, 1996, pp. 339-348; also J ACM 45 (1998), 653-750.
15. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, Proc 37th Annu IEEE FOCS, Burlington, Vermont, 1996, pp. 339-348; also J ACM 45 (1998), 653-750.
16. O. Goldreich and D. Ron, Property testing in bounded degree graphs, Proc 29th STOC, El Paso, Texas, 1997, pp. 406-415.
17. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, Proc 42nd IEEE FOCS, IEEE, Las Vegas, Nevada, 2001, pp. 460-469.
18. D. R. Heath-Brown, Integer sets containing no arithmetic progressions, J Lond Math Soc 35 (1987), 385-394.
19. P. Hell and J. Nesetril, The core of a graph, Discrete Math 109 (1992), 117-126.
20. T. Kovári, V. T. Sós, and P. Turán, On a problem of K. Zarankiewicz, Coll Math 3 (1954), 50-57.
21. V. Rödl and R. Duke, On graphs with small subgraphs of large chromatic number, Graphs Combinat 1 (1985), 91-96.
22. D. Ron, "Property testing," S. Rajasekaran, P. M. Pardalos, J. Reif and J. D. P. Rolim, Handbook of randomized algorithms, (Editors), Kluwer Academic, Dordrecht, 2001, Vol. II, pp. 597-649.
23. K. Roth, On certain sets of integers, J Lond Math Soc 28 (1953), 104-109.
24. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J Comput 25 (1996), 252-271.
25. E. Szemerédi, Regular partitions of graphs, Proc Coll Int CNRS, J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, (Editors), Orsay, 1978, pp. 399-401.
26. E. Szemerédi, Integer sets containing no arithmetic progressions, Acta Math Acad Sci Hung 56 (1990), 155-158.