{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T13:31:57Z","timestamp":1768743117652,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s00493-009-2320-x","type":"journal-article","created":{"date-parts":[[2010,8,3]],"date-time":"2010-08-03T07:22:08Z","timestamp":1280820128000},"page":"467-501","source":"Crossref","is-referenced-by-count":42,"title":["Generalizations of the removal lemma"],"prefix":"10.1007","volume":"29","author":[{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"first","affiliation":[]},{"given":"Mathias","family":"Schacht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,4]]},"reference":[{"issue":"4","key":"2320_CR1","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N. Alon","year":"2000","unstructured":"N. Alon, E. Fischer, M. Krivelevich and M. Szegedy: Efficient testing of large graphs, Combinatorica 20(4) (2000), 451\u2013476.","journal-title":"Combinatorica"},{"key":"2320_CR2","doi-asserted-by":"crossref","unstructured":"N. Alon and A. Shapira: A characterization of the (natural) graph properties testable with one-sided error, in: Proceedings of the fourty-sixth annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, 2005, pp. 429\u2013438.","DOI":"10.1109\/SFCS.2005.5"},{"key":"2320_CR3","doi-asserted-by":"crossref","unstructured":"N. Alon and A. Shapira: Every monotone graph property is testable, in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (New York, NY, USA), ACM Press, 2005, pp. 128\u2013137.","DOI":"10.1145\/1060590.1060611"},{"issue":"1","key":"2320_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/060652294","volume":"21","author":"C. Avart","year":"2007","unstructured":"C. Avart, V. R\u00f6dl and M. Schacht: Every monotone 3-graph property is testable, SIAM J. Discrete Math. 21(1) (2007), 73\u201392. (electronic).","journal-title":"SIAM J. Discrete Math"},{"key":"2320_CR5","first-page":"29","volume-title":"Ann. Discrete Math","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s, P. Erd\u0151s, M. Simonovits and E. Szemer\u00e9di: Extremal graphs without large forbidden subgraphs, Ann. Discrete Math. 3 (1978), 29\u201341, Advances in graph theory (Cambridge Combinatorial Conf., Trinity Coll., Cambridge, 1977)."},{"key":"2320_CR6","doi-asserted-by":"crossref","unstructured":"C. Borgs, J. Chayes, L. Lov\u00e1sz, V. T. S\u00f3s, B. Szegedy and K. Vesztergombi: Graph limits and parameter testing, in: STOC\u201906: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (New York), ACM, 2006, pp. 261\u2013270.","DOI":"10.1145\/1132516.1132556"},{"key":"2320_CR7","first-page":"53","volume-title":"New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich., 1971)","author":"W. G. Brown","year":"1973","unstructured":"W. G. Brown, P. Erd\u0151s 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), Academic Press, New York, 1973, pp. 53\u201363."},{"issue":"1","key":"2320_CR8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02582932","volume":"1","author":"R. A. Duke","year":"1985","unstructured":"R. A. Duke and V. R\u00f6dl: On graphs with small subgraphs of large chromatic number, Graphs Combin. 1(1) (1985), 91\u201396.","journal-title":"Graphs Combin"},{"key":"2320_CR9","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":"P. Erd\u0151s","year":"1990","unstructured":"P. Erd\u0151s: Problems and results on graphs and hypergraphs: similarities and differences; in: Mathematics of Ramsey theory (J. Ne\u0161et\u0159il and V. R\u00f6dl, eds.), Algorithms Combin., vol. 5, Springer, Berlin, 1990, pp. 12\u201328."},{"issue":"2","key":"2320_CR10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01788085","volume":"2","author":"P. Erd\u0151s","year":"1986","unstructured":"P. Erd\u0151s, P. Frankl and V. R\u00f6dl: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs Combin. 2(2) (1986), 113\u2013121.","journal-title":"Graphs Combin"},{"issue":"2","key":"2320_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/rsa.10017","volume":"20","author":"P. Frankl","year":"2002","unstructured":"P. Frankl and V. R\u00f6dl: Extremal problems on set systems, Random Structures Algorithms 20(2) (2002), 131\u2013164.","journal-title":"Random Structures Algorithms"},{"key":"2320_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02790016","volume":"34","author":"H. Furstenberg","year":"1978","unstructured":"H. Furstenberg and Y. Katznelson: An ergodic Szemer\u00e9di theorem for commuting transformations, J. Analyse Math. 34 (1978), 275\u2013291.","journal-title":"J. Analyse Math"},{"key":"2320_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02792547","volume":"45","author":"H. Furstenberg","year":"1985","unstructured":"H. Furstenberg and Y. Katznelson: An ergodic Szemer\u00e9di theorem for IPsystems and combinatorial theory, J. Analyse Math. 45 (1985), 117\u2013168.","journal-title":"J. Analyse Math"},{"issue":"4","key":"2320_CR14","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, S. Goldwasser and D. Ron: Property testing and its connection to learning and approximation, J. ACM 45(4) (1998), 653\u2013750.","journal-title":"J. ACM"},{"issue":"3","key":"2320_CR15","doi-asserted-by":"crossref","first-page":"897","DOI":"10.4007\/annals.2007.166.897","volume":"166","author":"W. T. Gowers","year":"2007","unstructured":"W. T. Gowers: Hypergraph regularity and the multidimensional Szemer\u00e9di theorem, Ann. of Math. (2) 166(3) (2007), 897\u2013946.","journal-title":"Ann. of Math. (2)"},{"key":"2320_CR16","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/3-540-45465-9_87","volume-title":"Automata, languages and programming","author":"Y. Kohayakawa","year":"2002","unstructured":"Y. Kohayakawa, B. Nagle and V. R\u00f6dl: Efficient testing of hypergraphs (extended abstract), in: Automata, languages and programming, Lecture Notes in Comput. Sci., vol. 2380, Springer, Berlin, 2002, pp. 1017\u20131028."},{"key":"2320_CR17","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-45878-6_3","volume-title":"Theoretical aspects of computer science (Tehran, 2000)","author":"J. Koml\u00f3s","year":"2002","unstructured":"J. Koml\u00f3s, A. Shokoufandeh, M. Simonovits and E. Szemer\u00e9di: The regularity lemma and its applications in graph theory, in: Theoretical aspects of computer science (Tehran, 2000), Lecture Notes in Comput. Sci., vol. 2292, Springer, Berlin, 2002, pp. 84\u2013112."},{"key":"2320_CR18","unstructured":"L. Lov\u00e1sz and B. Szegedy: Limits of dense graph sequences, Tech. Report MSRTR-2004-79, Microsoft Research, 2004."},{"key":"2320_CR19","unstructured":"L. Lov\u00e1sz and B. Szegedy: Graph limits and testing hereditary graph properties, Tech. Report MSR-TR-2005-110, Microsoft Research, 2005."},{"issue":"2","key":"2320_CR20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/rsa.20117","volume":"28","author":"B. Nagle","year":"2006","unstructured":"B. Nagle, V. R\u00f6dl and M. Schacht: The counting lemma for regular k-uniform hypergraphs, Random Structures Algorithms 28(2) (2006), 113\u2013179.","journal-title":"Random Structures Algorithms"},{"issue":"23","key":"2320_CR21","doi-asserted-by":"crossref","first-page":"8109","DOI":"10.1073\/pnas.0502771102","volume":"102","author":"V. R\u00f6dl","year":"2005","unstructured":"V. R\u00f6dl, B. Nagle, J. Skokan, M. Schacht and Y. Kohayakawa: The hypergraph regularity method and its applications, Proc. Natl. Acad. Sci. USA 102(23) (2005), 8109\u20138113 (electronic).","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"6","key":"2320_CR22","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1017\/S0963548307008565","volume":"16","author":"V. R\u00f6dl","year":"2007","unstructured":"V. R\u00f6dl and M. Schacht: Regular partitions of hypergraphs: Counting lemmas; Combin. Probab. Comput. 16(6) (2007), 887\u2013901.","journal-title":"Combin. Probab. Comput"},{"issue":"6","key":"2320_CR23","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1017\/S0963548307008553","volume":"16","author":"V. R\u00f6dl","year":"2007","unstructured":"V. R\u00f6dl and M. Schacht: Regular partitions of hypergraphs: Regularity lemmas; Combin. Probab. Comput. 16(6) (2007), 833\u2013885.","journal-title":"Combin. Probab. Comput"},{"key":"2320_CR24","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02771992","volume":"152","author":"V. R\u00f6dl","year":"2006","unstructured":"V. R\u00f6dl, M. Schacht, E. Tengan and N. Tokushige: Density theorems and extremal hypergraph problems, Israel J. Math. 152 (2006), 371\u2013380.","journal-title":"Israel J. Math"},{"issue":"1","key":"2320_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20017","volume":"25","author":"V. R\u00f6dl","year":"2004","unstructured":"V. R\u00f6dl and J. Skokan: Regularity lemma for k-uniform hypergraphs, Random Structures Algorithms 25(1) (2004), 1\u201342.","journal-title":"Random Structures Algorithms"},{"issue":"2","key":"2320_CR26","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/rsa.20108","volume":"28","author":"V. R\u00f6dl","year":"2006","unstructured":"V. R\u00f6dl and J. Skokan: Applications of the regularity lemma for uniform hypergraphs, Random Structures Algorithms 28(2) (2006), 180\u2013194.","journal-title":"Random Structures Algorithms"},{"key":"2320_CR27","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"939","volume-title":"Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976)","author":"I. Z. Ruzsa","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, Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 18, North-Holland, Amsterdam, 1978, pp. 939\u2013945."},{"issue":"2","key":"2320_CR28","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1017\/S0963548303005959","volume":"13","author":"J. Solymosi","year":"2004","unstructured":"J. Solymosi: A note on a question of Erd\u0151s and Graham, Combin. Probab. Comput. 13(2) (2004), 263\u2013267.","journal-title":"Combin. Probab. Comput"},{"issue":"23","key":"2320_CR29","doi-asserted-by":"crossref","first-page":"8075","DOI":"10.1073\/pnas.0503263102","volume":"102","author":"J. Solymosi","year":"2005","unstructured":"J. Solymosi: Regularity, uniformity, and quasirandomness; Proc. Natl. Acad. Sci. USA 102(23) (2005), 8075\u20138076 (electronic).","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"3\u20134","key":"2320_CR30","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02018585","volume":"3","author":"V. T. S\u00f3s","year":"1973","unstructured":"V. T. S\u00f3s, P. Erd\u0151s and W. G. Brown: On the existence of triangulated spheres in 3-graphs, and related problems; Period. Math. Hungar. 3(3\u20134) (1973), 221\u2013228.","journal-title":"Period. Math. Hungar"},{"key":"2320_CR31","doi-asserted-by":"crossref","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E. Szemer\u00e9di","year":"1975","unstructured":"E. Szemer\u00e9di: On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 199\u2013245, Collection of articles in memory of Juri\u012d Vladimirovi\u010d Linnik.","journal-title":"Acta Arith"},{"key":"2320_CR32","series-title":"Colloq. Internat. CNRS","first-page":"399","volume-title":"Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976)","author":"E. Szemer\u00e9di","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), Colloq. Internat. CNRS, vol. 260, CNRS, Paris, 1978, pp. 399\u2013401."},{"issue":"7","key":"2320_CR33","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1016\/j.jcta.2005.11.006","volume":"113","author":"T. Tao","year":"2006","unstructured":"T. Tao: A variant of the hypergraph removal lemma, J. Combin. Theory Ser. A 113(7) (2006), 1257\u20131280.","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2320-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2320-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2320-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:40:12Z","timestamp":1559364012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2320-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["2320"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2320-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7]]}}}