{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T08:00:12Z","timestamp":1773216012145,"version":"3.50.1"},"reference-count":32,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2007,11,1]],"date-time":"2007-11-01T00:00:00Z","timestamp":1193875200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2007,11]]},"abstract":"<jats:p>Szemer\u00e9di's regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this paper is to extend the techniques developed by Nagle, Skokan, and the authors and obtain a stronger and more \u2018user-friendly\u2019 regularity lemma for hypergraphs.<\/jats:p>","DOI":"10.1017\/s0963548307008553","type":"journal-article","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T09:44:37Z","timestamp":1185875077000},"page":"833-885","source":"Crossref","is-referenced-by-count":58,"title":["Regular Partitions of Hypergraphs: Regularity Lemmas"],"prefix":"10.1017","volume":"16","author":[{"given":"VOJT\u011aCH","family":"R\u00d6DL","sequence":"first","affiliation":[]},{"given":"MATHIAS","family":"SCHACHT","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2007,11,1]]},"reference":[{"key":"S0963548307008553_ref22","unstructured":"[22] Nagle B. , Sayaka O. , R\u00f6dl V. and Schacht M. On the Ramsey number of sparse 3-graphs. Submitted."},{"key":"S0963548307008553_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02790016"},{"key":"S0963548307008553_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF03041066"},{"key":"S0963548307008553_ref20","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20117"},{"key":"S0963548307008553_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45878-6_3"},{"key":"S0963548307008553_ref14","article-title":"The primes contain arbitrarily long arithmetic progressions","volume":"2","author":"Green","journal-title":"Ann. of Math."},{"key":"S0963548307008553_ref15","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1963-0143712-1"},{"key":"S0963548307008553_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305007236"},{"key":"S0963548307008553_ref23","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1017\/S0963548307008565","article-title":"Regular partitions of hypergraphs: counting lemmas","volume":"16","author":"R\u00f6dl","year":"2007","journal-title":"Combin. Probab. Comput."},{"key":"S0963548307008553_ref29","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303005959"},{"key":"S0963548307008553_ref5","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10017"},{"key":"S0963548307008553_ref26","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20017"},{"key":"S0963548307008553_ref19","first-page":"295","article-title":"Szemer\u00e9di's regularity lemma and its applications in graph theory","volume":"2","author":"Koml\u00f3s","year":"1996","journal-title":"Combinatorics: Paul Erd\\H os is Eighty"},{"key":"S0963548307008553_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33700-8_16"},{"key":"S0963548307008553_ref28","first-page":"939","volume-title":"Combinatorics: Proc. Fifth Hungarian Colloq","author":"Ruzsa","year":"1978"},{"key":"S0963548307008553_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070001"},{"key":"S0963548307008553_ref3","unstructured":"[3] Cooley O. , Fountoulakis N. , K\u00fchn D. and Osthus D. Embeddings and R amsey numbers of sparse k-uniform hypergraphs. Submitted."},{"key":"S0963548307008553_ref2","doi-asserted-by":"publisher","DOI":"10.1137\/060652294"},{"key":"S0963548307008553_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001621"},{"key":"S0963548307008553_ref17","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3217"},{"key":"S0963548307008553_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60539-0_16"},{"key":"S0963548307008553_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02792547"},{"key":"S0963548307008553_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788085"},{"key":"S0963548307008553_ref27","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20108"},{"key":"S0963548307008553_ref10","unstructured":"[10] Gowers W. T. Hypergraph regularity and the multidimensional Szemer\u00e9di theorem. Submitted."},{"key":"S0963548307008553_ref30","doi-asserted-by":"crossref","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","article-title":"On sets of integers containing no k elements in arithmetic progression","volume":"27","author":"Szemer\u00e9di","year":"1975","journal-title":"Acta Arith."},{"key":"S0963548307008553_ref6","first-page":"845","article-title":"A sharp threshold for random graphs with a monochromatic triangle in every edge coloring","volume":"179","author":"Friedgut","year":"2006","journal-title":"Mem. Amer. Math. Soc."},{"key":"S0963548307008553_ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2005.11.006"},{"key":"S0963548307008553_ref31","first-page":"399","article-title":"Regular partitions of graphs","volume":"260","author":"Szemer\u00e9di","year":"1978","journal-title":"Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes: Colloq. Internat. CNRS, Univ. Orsay, Orsay 1976"},{"key":"S0963548307008553_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-005-0509-8"},{"key":"S0963548307008553_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02771992"},{"key":"S0963548307008553_ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.05.006"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548307008553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:52:56Z","timestamp":1556725976000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548307008553\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["S0963548307008553"],"URL":"https:\/\/doi.org\/10.1017\/s0963548307008553","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11]]}}}