Efficient testing of hypergraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 1017-1028

  Kohayakawa, Yoshiharu ^a   Nagle, Brendan ^b,c   Rödl, Vojtěch ^d  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF NEVADA   (United States)

^d EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

3-UNIFORM HYPERGRAPHS; COMBINATORIAL PROPERTIES; HYPERGRAPH;

GRAPH THEORY;

EID: 84869200050     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_87     Document Type: Conference Paper

References (21)

1. N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The algorithmic aspects of the regularity lemma, J. Algorithms 16 (1994), no. 1, 80-109.
2. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Efficient testing of large graphs (extended abstract), 40th Annual Symposium on Foundations of Computer Science (New York City, NY), IEEE Comput. Soc. Press, 1999, pp. 656-666.
3. - Efficient testing of large graphs, Combinatorica 20 (2000), no. 4, 451-476.
4. Noga Alon, Testing subgraphs in large graphs, Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2001), 2001, pp. 434-439.
5. J. Bourgain, On triples in arithmetic progression, Geom. Funct. Anal. 9 (1999), no. 5, 968-984.
6. A. Czumaj and C. Sohler, Testing hypergraph coloring, Proc. of ICALP, 2001, pp. 493-505.
7. Peter Frankl and Vojtěch Rödl, Extremal problems on set systems, Random Structures and Algorithms 20 (2002), no. 2, 131-164.
8. Harry Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Analyse Math. 31 (1977), 204-256.
9. Oded Goldreich, Shafi Goldwasser, and Dana Ron, Property testing and its connection to learning and approximation, 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996), IEEE Comput. Soc. Press, Los Alamitos, CA, 1996, pp. 339-348.
10. - Property testing and its connection to learning and approximation, Journal of the Association for Computing Machinery 45 (1998), no. 4, 653-750.
11. W. T. Gowers, A newproof of Szemerédi's theorem for arithmetic progressions of length four, Geom. Funct. Anal. 8 (1998), no. 3, 529-551.
12. - A newpr oof of Szemerédi's theorem, Geom. Funct. Anal. 11 (2001), no. 3, 465-588.
13. Y. Kohayakawa, B. Nagle, and V. Rödl, Testing hypergraphs, In preparation, 2002.
14. Brendan Nagle and Vojtěch Rödl, Regularity properties for triple systems, Random Structures & Algorithms (2002), to appear.
15. Vojtěch Rödl and Jozef Skokan, Uniformity of set systems, manuscript, 2001.
16. Dana Ron, Property testing, Handbook of randomized algorithms (P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, eds.), Kluwer Academic Publishers, 2001, to appear.
17. K. F. Roth, On certain sets of integers, Journal of the London Mathematical Society 28 (1953), 104-109.
18. - Irregularities of sequences relative to arithmetic progressions. IV, Period. Math. Hungar. 2 (1972), 301-326, Collection of articles dedicated to the memory of Alfréd Rényi, I.
19. I. Z. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, Combinatorics (Proceedings of the Fifth Hungarian Colloquium, Keszthely, 1976), Vol. II (Amsterdam-New York), Colloq. Math. Soc. János Bolyai, no. 18, North-Holland, 1978, pp. 939-945.
20. E. Szemerédi, On sets of integers containing no four elements in arithmetic progression, Acta Mathematica Academiae Scientiarum Hungaricae 20 (1969), 89-104.
21. - On sets of integers containing no k elements in arithmetic progression, Acta Arithmetica 27 (1975), 199-245, collection of articles in memory of Juriǐ Vladimirovič Linnik