Testing triangle-freeness in general graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 279-288

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

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; MATHEMATICAL TRANSFORMATIONS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

CAYLEY GRAPHS; PROBABILITY OF ERROR; TRIANGLE-FREENESS;

GRAPH THEORY;

EID: 33244455857     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109589     Document Type: Conference Paper

References (15)

1. N. Alon. Testing subgraphs in large graphs. Random Structures and Algorithms, 21(3-4):359-370, 2002.
2. N. Alon, E. Fischer, M. Krivelevich, and M Szegedy. Efficient testing of large graphs. Combinatorica, 20:451-476, 2000.
3. N. Alon, T. Kaufman, M. Krivelevich, and D. Ron. Testing triangle-freeness in general graphs. Available from http://www.math.tau.ac.il/ ~krivelev, 2005.
4. N. Alon and A. Orlitsky. Repeated communication and Ramsey graphs. IEEE Transactions on Information Theory, 41:1276-1289, 1995.
5. N. Alon and Y. Roichman. Random Cayley graphs and expanders. Random Structures and Algorithms, 5:271-284, 1994.
6. N. Alon and A. Shapira. A characterization of easily testable induced subgraphs. In Proceedings of the 15th SODA, 2004.
7. N. Alon and A. Shapira. Testing subgraphs in directed graphs. JCSS, 69:354-482, 2004.
8. F. A. Behrend. On sets of integers which contain no three terms in arithmetic progression. Proc. National Academy of Sciences USA, 32:331-332, 1946.
9. O. Goldreich and D. Ron. Property testing in bounded degree graphs. Algorithmica, 32(2):302-343, 2002.
10. B. Green. Counting sets with small sumset, and the clique number of random Cayley graphs. Combinatorica, 25:307-326, 2005.
11. S. Janson, T. Luczak, and A. Ruciński. Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.
12. T. Kaufman, M. Krivelevich, and D. Ron. Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing, 33(6): 1441-1483, 2004.
13. M. Parnas and D. Ron. Testing the diameter of graphs. Random Structures and Algorithms, 20(2):165-183, 2002.
14. I. Z. Ruzsa and E. Szemerédi. Triple systems with no six points carrying three triangles. Combinatorics (Keszthely), Coll. Math. Soc. J. Bolyai 18, 2:939-945, 1976.
15. R. Salem and D. C. Spencer. On sets of integers which contain no three terms in arithmetical progression. Proc. National Academy of Sciences USA, 28:561-563, 1942.