{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:29:59Z","timestamp":1773145799901,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T00:00:00Z","timestamp":1496188800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00493-016-3274-4","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T00:11:27Z","timestamp":1496189487000},"page":"911-951","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A tight lower bound for Szemer\u00e9di\u2019s regularity lemma"],"prefix":"10.1007","volume":"37","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[]},{"given":"L\u00e1szl\u00f3 Mikl\u00f3s","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"3274_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(88)90189-6","volume":"72","author":"N Alon","year":"1988","unstructured":"N. Alon and F. R. K. Chung: Explicit construction of linear sized tolerant networks, Discrete Math.\n72 (1988), 15\u201319.","journal-title":"Discrete Math."},{"key":"3274_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The probabilistic method","author":"N Alon","year":"2008","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, third ed., John Wiley & Sons Inc., Hoboken, NJ, 2008.","edition":"third ed."},{"key":"3274_CR3","first-page":"109","volume-title":"Proceedings of the International Congress of Mathematicians","author":"B Bollob\u00e1s","year":"1998","unstructured":"B\u00e9la Bollob\u00e1s: The work of William Timothy Gowers, in: Proceedings of the International Congress of Mathematicians Vol. I (Berlin, 1998), no. Extra Vol. I, 1998, 109\u2013118 (electronic)."},{"key":"3274_CR4","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1016\/j.aim.2008.07.008","volume":"219","author":"C Borgs","year":"2008","unstructured":"C. Borgs, J. T. Chayes, L. Lov\u00e1sz, V. T. S\u00f3s and K. Vesztergombi: Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing, Adv. Math.\n219 (2008), 1801\u20131851.","journal-title":"Adv. Math."},{"key":"3274_CR5","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1007\/s00039-012-0171-x","volume":"22","author":"D Conlon","year":"2012","unstructured":"D. Conlon and J. Fox: Bounds for graph regularity and removal lemmas, Geom. Funct. Anal.\n22 (2012), 1191\u20131256.","journal-title":"Geom. Funct. Anal."},{"key":"3274_CR6","unstructured":"J Fox, L. M. Lov\u00e1sz and Y. Zhao: On regularity lemmas and their algorithmic applications, in preparation."},{"key":"3274_CR7","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/PL00001621","volume":"7","author":"W T Gowers","year":"1997","unstructured":"W. T. Gowers: Lower bounds of tower type for Szemer\u00e9di\u2019s uniformity lemma, Geom. Funct. Anal.\n7 (1997), 322\u2013337.","journal-title":"Geom. Funct. Anal."},{"key":"3274_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"W. Hoeffding: Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc.\n58 (1963), 13\u201330.","journal-title":"J. Amer. Statist. Assoc."},{"key":"3274_CR9","first-page":"295","volume-title":"Combinatorics, Paul Erd\u0151s is eighty","author":"J Koml\u00f3s","year":"1993","unstructured":"J. Koml\u00f3s and M. Simonovits: Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory, in: Combinatorics, Paul Erd\u0151s is eighty, Vol. 2 (Keszthely, 1993), Bolyai Soc. Math. Stud., vol. 2, J\u00e1nos Bolyai Math. Soc., Budapest, 1996, 295\u2013352."},{"key":"3274_CR10","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/s00039-007-0599-6","volume":"17","author":"L Lov\u00e1sz","year":"2007","unstructured":"L. Lov\u00e1sz and B. Szegedy: Szemer\u00e9di\u2019s lemma for the analyst, Geom. Funct. Anal.\n17 (2007), 252\u2013270.","journal-title":"Geom. Funct. Anal."},{"key":"3274_CR11","doi-asserted-by":"crossref","unstructured":"G. Moshkovitz and A. Shapira: A short proof of Gowers\u2019 lower bound for the regularity lemma, Combinatorica, to appear.","DOI":"10.1007\/s00493-014-3166-4"},{"key":"3274_CR12","series-title":"Bolyai Soc. Math. Stud.","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-642-13580-4_11","volume-title":"Fete of combinatorics and computer science","author":"V R\u00f6dl","year":"2010","unstructured":"V. R\u00f6dl and M. Schacht: Regularity lemmas for graphs, in: Fete of combinatorics and computer science, Bolyai Soc. Math. Stud., vol. 20, J\u00e1nos Bolyai Math. Soc., Budapest, 2010, 287\u2013325."},{"key":"3274_CR13","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.\n27 (1975), 199\u2013245.","journal-title":"Acta Arith."},{"key":"3274_CR14","series-title":"Colloq. Internat. CNRS","first-page":"399","volume-title":"Probl\u00e8mes combinatoires et th\u00e9orie des graphes","author":"E Szemer\u00e9di","year":"1976","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, 399\u2013401."},{"key":"3274_CR15","first-page":"8","volume":"1","author":"T Tao","year":"2006","unstructured":"T. Tao: Szemer\u00e9di\u2019s regularity lemma revisited, Contrib. Discrete Math.\n1 (2006), 8\u201328.","journal-title":"Contrib. Discrete Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3274-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3274-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3274-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T23:59:20Z","timestamp":1513295960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3274-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,31]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["3274"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3274-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,31]]}}}