{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:20:30Z","timestamp":1737091230782,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_87","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"1017-1028","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Testing of Hypergraphs"],"prefix":"10.1007","author":[{"given":"Yoshiharu","family":"Kohayakawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Nagle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"issue":"1","key":"87_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jagm.1994.1005","volume":"16","author":"N. Alon","year":"1994","unstructured":"N. Alon, R. A. Duke, H. Lefmann, V. R\u00f6dl, and R. Yuster, The algorithmic aspects of the regularity lemma, J. Algorithms 16 (1994), no. 1, 80\u2013109.","journal-title":"J. Algorithms"},{"key":"87_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013666.","DOI":"10.1109\/SFFCS.1999.814642"},{"issue":"4","key":"87_CR3","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N. Alon","year":"2000","unstructured":"-, Efficient testing of large graphs, Combinatorica 20 (2000), no. 4, 451\u2013476.","journal-title":"Combinatorica"},{"key":"87_CR4","doi-asserted-by":"crossref","unstructured":"Noga Alon, Testing subgraphs in large graphs, Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2001), 2001, pp. 434\u2013439.","DOI":"10.1109\/SFCS.2001.959918"},{"issue":"5","key":"87_CR5","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s000390050105","volume":"9","author":"J. Bourgain","year":"1999","unstructured":"J. Bourgain, On triples in arithmetic progression, Geom. Funct. Anal. 9 (1999), no. 5, 968\u2013984.","journal-title":"Geom. Funct. Anal."},{"key":"87_CR6","doi-asserted-by":"crossref","unstructured":"A. Czumaj and C. Sohler, Testing hypergraph coloring, Proc. of ICALP, 2001, pp. 493\u2013505.","DOI":"10.1007\/3-540-48224-5_41"},{"issue":"2","key":"87_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/rsa.10017","volume":"20","author":"P. Frankl","year":"2002","unstructured":"Peter Frankl and Vojt\u011bch R\u00f6dl, Extremal problems on set systems, Random Structures and Algorithms 20 (2002), no. 2, 131\u2013164.","journal-title":"Random Structures and Algorithms"},{"key":"87_CR8","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BF02813304","volume":"31","author":"H. Furstenberg","year":"1977","unstructured":"Harry Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemer\u00e9di on arithmetic progressions, J. Analyse Math. 31 (1977), 204\u2013256.","journal-title":"J. Analyse Math."},{"key":"87_CR9","first-page":"339","volume-title":"37th Annual Symposium on Foundations of Computer Science (Burlington, VT, 1996)","author":"O. Goldreich","year":"1996","unstructured":"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\u2013348."},{"issue":"4","key":"87_CR10","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"-, Property testing and its connection to learning and approximation, Journal of the Association for Computing Machinery 45 (1998), no. 4, 653\u2013750.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"87_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s000390050065","volume":"8","author":"W. T. Gowers","year":"1998","unstructured":"W. T. Gowers, A new proof of Szemer\u00e9di\u2019s theorem for arithmetic progressions of length four, Geom. Funct. Anal. 8 (1998), no. 3, 529\u2013551.","journal-title":"Geom. Funct. Anal."},{"key":"87_CR12","unstructured":"-, A new proof of Szemer\u00e9di\u2019s theorem, Geom. Funct. Anal. 11 (2001), no. 3, 465\u2013588."},{"key":"87_CR13","unstructured":"Y. Kohayakawa, B. Nagle, and V. R\u00f6dl, Testing hypergraphs, In preparation, 2002."},{"key":"87_CR14","doi-asserted-by":"crossref","unstructured":"Brendan Nagle and Vojt\u011bch R\u00f6dl, Regularity properties for triple systems, Random Structures & Algorithms (2002), to appear.","DOI":"10.1002\/rsa.10094"},{"key":"87_CR15","unstructured":"Vojte\u010dh R\u00f6dl and Jozef Skokan, Uniformity of set systems, manuscript, 2001."},{"key":"87_CR16","unstructured":"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."},{"key":"87_CR17","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1112\/jlms\/s1-28.1.104","volume":"28","author":"K. F. Roth","year":"1953","unstructured":"K. F. Roth, On certain sets of integers, Journal of the London Mathematical Society 28 (1953), 104\u2013109.","journal-title":"Journal of the London Mathematical Society"},{"key":"87_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF02018670","volume":"2","author":"K. F. Roth","year":"1972","unstructured":"-, Irregularities of sequences relative to arithmetic progressions. IV, Period. Math. Hungar. 2 (1972), 301\u2013326, Collection of articles dedicated to the memory of Alfr\u00e9d R\u00e9nyi, I.","journal-title":"Period. Math. Hungar."},{"issue":"18","key":"87_CR19","first-page":"939","volume":"II","author":"I. Z. Ruzsa","year":"1978","unstructured":"I. Z. Ruzsa and E. Szemer\u00e9di, 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\u00e1nos Bolyai, no. 18, North-Holland, 1978, pp. 939\u2013945.","journal-title":"Combinatorics (Proceedings of the Fifth Hungarian Colloquium, Keszthely, 1976)"},{"key":"87_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01894569","volume":"20","author":"E. Szemer\u00e9di","year":"1969","unstructured":"E. Szemer\u00e9di, On sets of integers containing no four elements in arithmetic progression, Acta Mathematica Academiae Scientiarum Hungaricae 20 (1969), 89\u2013104.","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"87_CR21","doi-asserted-by":"crossref","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E. Szemer\u00e9di","year":"1975","unstructured":"-, On sets of integers containing no k elements in arithmetic progression, Acta Arithmetica 27 (1975), 199\u2013245, collection of articles in memory of Jurii Vladimirovi\u010d Linnik.","journal-title":"Acta Arithmetica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_87","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:27:09Z","timestamp":1737052029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_87","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}