{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:29:49Z","timestamp":1756189789059,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250862","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"488-495","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Property testing in hypergraphs and the removal lemma"],"prefix":"10.1145","author":[{"given":"V.","family":"R\u00f6dl","sequence":"first","affiliation":[{"name":"Emory University, Atlanta, GA"}]},{"given":"M.","family":"Schacht","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1005"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132555"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060611"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33700-8_17"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/060652294"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100225"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70495-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132556"},{"key":"e_1_3_2_1_12_1","first-page":"53","volume-title":"Third Ann Arbor Conf.","author":"Brown W. G.","year":"1971","unstructured":"W. G. Brown , P. Erdos , and V. T. S\u00f3s . Some extremal problems on r-graphs. In New directions in the theory of graphs (Proc . Third Ann Arbor Conf. , Univ. Michigan, Ann Arbor, Mich , 1971 ), pages 53 -- 63 . Academic Press, New York, 1973. W. G. Brown, P. Erdos, and V. T. S\u00f3s. Some extremal problems on r-graphs. In New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich, 1971), pages 53--63. Academic Press, New York, 1973."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02582932"},{"key":"e_1_3_2_1_14_1","series-title":"Algorithms Combin","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/978-3-642-72905-8_2","volume-title":"Mathematics of Ramsey theory","author":"Erdos P.","year":"1990","unstructured":"P. Erdos . Problems and results on graphs and hypergraphs: similarities and differences . In J. NeaetYil and V. R\u00f6dl, editors, Mathematics of Ramsey theory , volume 5 of Algorithms Combin ., pages 12 -- 28 . Springer , Berlin , 1990 . P. Erdos. Problems and results on graphs and hypergraphs: similarities and differences. In J. NeaetYil and V. R\u00f6dl, editors, Mathematics of Ramsey theory, volume 5 of Algorithms Combin., pages 12--28. Springer, Berlin, 1990."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788085"},{"key":"e_1_3_2_1_16_1","volume-title":"The art of uninformed decisions: a primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, (75):97--126","author":"Fischer E.","year":"2001","unstructured":"E. Fischer . The art of uninformed decisions: a primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, (75):97--126 , 2001 . E. Fischer. The art of uninformed decisions: a primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, (75):97--126, 2001."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10017.abs"},{"key":"e_1_3_2_1_18_1","series-title":"DIMACS Ser","first-page":"45","volume-title":"Randomization methods in algorithm design (Princeton","author":"Goldreich O.","year":"1997","unstructured":"O. Goldreich . Combinatorial property testing (a survey) . In Randomization methods in algorithm design (Princeton , NJ, 1997 ), volume 43 of DIMACS Ser . Discrete Math. Theoret. Comput. Sci., pages 45 -- 59 . Amer. Math. Soc., Providence, RI , 1999. O. Goldreich. Combinatorial property testing (a survey). In Randomization methods in algorithm design (Princeton, NJ, 1997), volume 43 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 45--59. Amer. Math. Soc., Providence, RI, 1999."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"e_1_3_2_1_20_1","unstructured":"W. T. Gowers. Hypergraph regularity and the multidimensional Szemer\u00e9di theorem. submitted.  W. T. Gowers. Hypergraph regularity and the multidimensional Szemer\u00e9di theorem. submitted."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.17"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Comput","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/3-540-45465-9_87","volume-title":"Automata, languages and programming","author":"Kohayakawa Y.","year":"2002","unstructured":"Y. Kohayakawa , B. Nagle , and V. R\u00f6dl . Efficient testing of hypergraphs (extended abstract) . In Automata, languages and programming , volume 2380 of Lecture Notes in Comput . Sci., pages 1017 -- 1028 . Springer , Berlin, 2002 . Y. Kohayakawa, B. Nagle, and V. R\u00f6dl. Efficient testing of hypergraphs (extended abstract). In Automata, languages and programming, volume 2380 of Lecture Notes in Comput. Sci., pages 1017--1028. Springer, Berlin, 2002."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v28:2"},{"key":"e_1_3_2_1_26_1","unstructured":"V. R\u00f6dl and M. Schacht. Generalizations of the removal lemma. submitted.  V. R\u00f6dl and M. Schacht. Generalizations of the removal lemma. submitted."},{"key":"e_1_3_2_1_27_1","unstructured":"V. R\u00f6dl and M. Schacht. Regular partitions of hypergraph. Combin. Probab. Comput. to appear.  V. R\u00f6dl and M. Schacht. Regular partitions of hypergraph. Combin. Probab. Comput. to appear."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20017"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v28:2"},{"key":"e_1_3_2_1_30_1","series-title":"Comb","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/978-1-4615-0013-1_15","volume-title":"Handbook of randomized computing","author":"Ron D.","year":"2001","unstructured":"D. Ron . Property testing . In Handbook of randomized computing , Vol. I , II, volume 9 of Comb . Optim., pages 597 -- 649 . Kluwer Acad . Publ., Dordrecht, 2001 . D. Ron. Property testing. In Handbook of randomized computing, Vol. I, II, volume 9 of Comb. Optim., pages 597--649. Kluwer Acad. Publ., Dordrecht, 2001."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"e_1_3_2_1_32_1","volume-title":"Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976)","author":"Ruzsa I. Z.","year":"1978","unstructured":"I. Z. Ruzsa and E. Szemer\u00e9di . Triple systems with no six points carrying three triangles . In Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976) , Vol. II , volume 18 of Colloq. Math. Soc. J\u00e1nos Bolyai, pages 939--945. North-Holland, Amsterdam , 1978 . I. Z. Ruzsa and E. Szemer\u00e9di. Triple systems with no six points carrying three triangles. In Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, volume 18 of Colloq. Math. Soc. J\u00e1nos Bolyai, pages 939--945. North-Holland, Amsterdam, 1978."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018585"},{"key":"e_1_3_2_1_34_1","first-page":"399","volume-title":"Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS","author":"Szemer\u00e9di E.","year":"1978","unstructured":"E. Szemer\u00e9di . Regular partitions of graphs. In Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS , Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS , pages 399 -- 401 . CNRS, Paris , 1978 . E. Szemer\u00e9di. Regular partitions of graphs. In Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS, pages 399--401. CNRS, Paris, 1978."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2005.11.006"}],"event":{"name":"STOC07: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego California USA","acronym":"STOC07"},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250862","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:21Z","timestamp":1750258341000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":33,"alternative-id":["10.1145\/1250790.1250862","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250862","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}