Testing triangle-freeness in general graphs

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 2, 2008, Pages 786-819

  Alon, Noga ^a,b   Kaufman, Tali ^c   Krivelevich, Michael ^a   Ron, Dana ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Cayley graphs; Property testing; Randomized algorithms; Subgraph freeness; Triangle freeness

Indexed keywords

CAYLEY GRAPHS; PROPERTY TESTING; RANDOMIZED ALGORITHMS; SUBGRAPH-FREENESS; TRIANGLE-FREENESS;

APPROXIMATION ALGORITHMS; CONTROL THEORY;

GRAPH THEORY;

EID: 67149135053     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/07067917X     Document Type: Article

References (20)

1. N. ALON, Testing subgraphs in large graphs, Random Structures Algorithms, 21 (2002), pp. 359-370.
2. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
3. N. ALON AND A. ORLITSKY, Repeated communication and ramsey graphs, IEEE Trans. Inform. Theory, 41 (1995), pp. 1276-1289.
4. N. ALON AND Y. ROICHMAN, Random Cayley graphs and expanders, Random Structures Algorithms, 5 (1994), pp. 271-284.
5. N. ALON AND A. SHAPIRA, A characterization of easily testable induced subgraphs, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadelphia, 2004, pp. 942-951.
6. N. ALON AND A. SHAPIRA, Testing subgraphs in directed graphs, J. Comput. System Sci., 69 (2004), pp. 353-382.
7. F. A. BEHREND, On sets of integers which contain no three terms in arithmetic progression, Proc. Nat. Acad. Sci. USA, 32 (1946), pp. 331-332.
8. E. FISCHER, The art of uninformed decisions: A primer to property testing, Bullet. Eur. Assoc. Theoret. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
9. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approxím.ation, J. ACM, 45 (1998), pp. 653-750.
10. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343.
11. B. GREEN, Counting sets with small sumset, and the clique number of random Cayley graphs, Combinatorica, 25 (2005), pp. 307-326.
12. L. GUGELMANN, Testing Triangle-Preeness in General Graphs: Lower Bounds, Bachelor thesis, Dept. of Mathematics, ETH, Zurich, 2006.
13. S. JANSON, T. łUCZAK, AND A. RUCIŃSKI, Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.
14. T. KAUFMAN, M. KRIVELEVICH, AND D. RON, Tight bounds for testing bipartiteness in general graphs, SIAM J. Comput., 33 (2004), pp. 1441-1483.
15. M. PARNAS AND D. RON, Testing the diameter of graphs, Random Structures Algorithms, 20 (2002), pp. 165-183.
16. T. RAST, Testing Triangle-Freeness in General Graphs: Upper Bounds, Bachelor thesis, Dept. of Mathematics, ETH, Zurich, 2006.
17. D. RON, Property testing, in Handbook of Randomized Computing, Volume II, S. Rajasekaran, P. M. Pardalos, J. H. Reif, and J. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
18. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
19. I. Z. RUZSA AND E. SZEMERÉDI, Triple systems with no six points carrying three triangles, Coll. Math. Soc. J. Bolyai., 18 (1976), pp. 939-945.
20. R. SALEM AND D. C. SPENCER, On sets of integers which contain no three terms in arithmetical progression, Proc. Nat. Acad. Sci. USA, 28 (1942), pp. 561-563.