{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T22:54:02Z","timestamp":1775861642567,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"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,3]]},"DOI":"10.1007\/s00493-009-2475-5","type":"journal-article","created":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T22:43:22Z","timestamp":1576104202000},"page":"153-196","source":"Crossref","is-referenced-by-count":61,"title":["Density theorems for bipartite graphs and related Ramsey-type results"],"prefix":"10.1007","volume":"29","author":[{"given":"Jacob","family":"Fox","sequence":"first","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,24]]},"reference":[{"key":"2475_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/jgt.3190180406","volume":"18","author":"N. Alon","year":"1994","unstructured":"N. Alon: Subdivided graphs have linear Ramsey numbers, J. Graph Theory\n                           18 (1994), 343\u2013347.","journal-title":"J. Graph Theory"},{"key":"2475_CR2","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\n                           16 (1994), 80\u2013109.","journal-title":"J. Algorithms"},{"key":"2475_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S0963548303005741","volume":"12","author":"N. Alon","year":"2003","unstructured":"N. Alon, M. Krivelevich and B. Sudakov: Tur\u00e1n numbers of bipartite graphs and related Ramsey-type questions, Combin. Probab. Comput.\n                           12 (2003), 477\u2013494.","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"2475_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s004930100016","volume":"21","author":"N. Alon","year":"2001","unstructured":"N. Alon, J. Pach and J. Solymosi: Ramsey-type theorems with forbidden subgraphs, Combinatorica\n                           21(2) (2001), 155\u2013170.","journal-title":"Combinatorica"},{"key":"2475_CR5","doi-asserted-by":"crossref","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, 2nd ed., Wiley, 2000.","DOI":"10.1002\/0471722154"},{"key":"2475_CR6","first-page":"401","volume":"18","author":"J. Beck","year":"1983","unstructured":"J. Beck: An upper bound for diagonal Ramsey numbers, Studia Sci. Math. Hungar.\n                           18 (1983), 401\u2013406.","journal-title":"Studia Sci. Math. Hungar."},{"key":"2475_CR7","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1006\/eujc.1997.0188","volume":"19","author":"B. Bollob\u00e1s","year":"1998","unstructured":"B. Bollob\u00e1s and A. Thomason: Proof of a conjecture of Mader, Erd\u0151s and Hajnal on topological complete subgraphs; European J. Combin.\n                           19 (1998), 883\u2013887.","journal-title":"European J. Combin."},{"key":"2475_CR8","first-page":"214","volume-title":"Infinite and Finite Sets I","author":"S. A. Burr","year":"1975","unstructured":"S. A. Burr and P. Erd\u0151s: On the magnitude of generalized Ramsey numbers for graphs, in: Infinite and Finite Sets I, 10, Colloq. Math. Soc. J\u00e1nos Bolyai, North-Holland, Amsterdam, 1975, 214\u2013240."},{"key":"2475_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/PL00009495","volume":"23","author":"G. Cairns","year":"2000","unstructured":"G. Cairns and Y. Nikolayevsky: Bounds for generalized thrackles, Discrete Comput. Geom.\n                           23 (2000), 191\u2013206.","journal-title":"Discrete Comput. Geom."},{"key":"2475_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.1993.1012","volume":"57","author":"G. Chen","year":"1993","unstructured":"G. Chen and R. H. Schelp: Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B\n                           57 (1993), 138\u2013149.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2475_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","volume":"34","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal, V. R\u00f6dl, E. Szemer\u00e9di and W. T. Trotter, Jr.: The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B\n                           34 (1983), 239\u2013243.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2475_CR12","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1016\/j.jctb.2008.02.005","volume":"98","author":"M. Chudnovsky","year":"2008","unstructured":"M. Chudnovsky and S. Safra: The Erd\u0151s-Hajnal conjecture for bull-free graphs, J. Combin. Theory Ser. B\n                           98 (2008), 1301\u20131310.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2475_CR13","doi-asserted-by":"crossref","unstructured":"D. Conlon: A new upper bound for diagonal Ramsey numbers, Ann. of Math.\n                           170 (2009), to appear.","DOI":"10.4007\/annals.2009.170.941"},{"key":"2475_CR14","unstructured":"R. Diestel: Graph theory, 2nd ed., Springer, 1997."},{"key":"2475_CR15","doi-asserted-by":"crossref","unstructured":"N. Eaton: Ramsey numbers for sparse graphs, Discrete Math.\n                           185, 63\u201375.","DOI":"10.1016\/S0012-365X(97)00184-2"},{"key":"2475_CR16","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P. Erd\u0151s","year":"1947","unstructured":"P. Erd\u0151s: Some remarks on the theory of graphs, Bull. Amer. Math. Soc.\n                           53 (1947), 292\u2013294.","journal-title":"Bull. Amer. Math. Soc."},{"key":"2475_CR17","first-page":"153","volume-title":"Graph theory and related topics (Proc. Conf. Waterloo, 1977)","author":"P. Erd\u0151s","year":"1979","unstructured":"P. Erd\u0151s: Problems and results in graph theory and combinatorial analysis, in: Graph theory and related topics (Proc. Conf. Waterloo, 1977), Academic Press, New York (1979), 153\u2013163."},{"key":"2475_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(89)90045-0","volume":"25","author":"P. Erd\u0151s","year":"1989","unstructured":"P. Erd\u0151s and A. Hajnal: Ramsey-type theorems, Discrete Appl. Math.\n                           25 (1989), 37\u201352.","journal-title":"Discrete Appl. Math."},{"key":"2475_CR19","first-page":"64","volume":"10","author":"P. Erd\u0151s","year":"2000","unstructured":"P. Erd\u0151s, A. Hajnal and J. Pach: Ramsey-type theorem for bipartite graphs, Geombinatorics\n                           10 (2000), 64\u201368.","journal-title":"Geombinatorics"},{"key":"2475_CR20","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres: A combinatorial problem in geometry, Compositio Math.\n                           2 (1935), 463\u2013470.","journal-title":"Compositio Math."},{"key":"2475_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/jgt.20256","volume":"57","author":"J. Fox","year":"2008","unstructured":"J. Fox: There exist graphs with super-exponential Ramsey multiplicity constant, J. Graph Theory\n                           57 (2008), 89\u201398.","journal-title":"J. Graph Theory"},{"key":"2475_CR22","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.aim.2008.06.002","volume":"219","author":"J. Fox","year":"2008","unstructured":"J. Fox and J. Pach: Separator theorem and Tur\u00e1n-type results for planar intersection graphs, Adv. Math.\n                           219 (2008), 1070\u20131080.","journal-title":"Adv. Math."},{"key":"2475_CR23","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1016\/j.aim.2008.07.009","volume":"219","author":"J. Fox","year":"2008","unstructured":"J. Fox and B. Sudakov: Induced Ramsey-type theorems, Adv. Math.\n                           219 (2008), 1771\u20131800.","journal-title":"Adv. Math."},{"key":"2475_CR24","unstructured":"J. Fox and B. Sudakov: Two remarks on the Burr-Erd\u0151s conjecture, European J. Combin., to appear."},{"key":"2475_CR25","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.\n                           8 (1998), 529\u2013551.","journal-title":"Geom. Funct. Anal."},{"key":"2475_CR26","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1002\/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C","volume":"35","author":"R. Graham","year":"2000","unstructured":"R. Graham, V. R\u00f6dl and A. Ruci\u0144ski: On graphs with linear Ramsey numbers, J. Graph Theory\n                           35 (2000), 176\u2013192.","journal-title":"J. Graph Theory"},{"key":"2475_CR27","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s004930100018","volume":"212","author":"R. Graham","year":"2001","unstructured":"R. Graham, V. R\u0151dl and A. Ruci\u0144ski: On bipartite graphs with linear Ramsey numbers, Combinatorica\n                           21(2) (2001), 199\u2013209.","journal-title":"Combinatorica"},{"key":"2475_CR28","volume-title":"Ramsey theory","author":"R. Graham","year":"1990","unstructured":"R. Graham, B. Rothschild and J. Spencer: Ramsey theory, 2nd ed., Wiley, New York, 1990.","edition":"2nd ed."},{"key":"2475_CR29","doi-asserted-by":"publisher","first-page":"481","DOI":"10.4007\/annals.2008.167.481","volume":"167","author":"B. Green","year":"2008","unstructured":"B. Green and T. Tao: The primes contain arbitrarily long arithmetic progressions, Annals of Math.\n                           167 (2008), 481\u2013547.","journal-title":"Annals of Math."},{"key":"2475_CR30","unstructured":"H. Hatami: Graph norms and Sidorenko\u2019s conjecture, Israel Journal of Mathematics, to appear."},{"issue":"3","key":"2475_CR31","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009828","volume":"18","author":"Y. Kohayakawa","year":"1998","unstructured":"Y. Kohayakawa, H. Pr\u00f6mel and V. R\u00f6dl: Induced Ramsey numbers, Combinatorica\n                           18(3) (1998), 373\u2013404.","journal-title":"Combinatorica"},{"key":"2475_CR32","series-title":"Bolyai Soc. Math. Stud.","first-page":"295","volume-title":"Combinatorics, Paul Erd\u0151s is eighty, Vol. 2","author":"J. Koml\u00f3s","year":"1996","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), 295\u2013352, Bolyai Soc. Math. Stud., 2, Jnos Bolyai Math. Soc., Budapest, 1996."},{"key":"2475_CR33","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1017\/S096354830000184X","volume":"5","author":"J. Koml\u00f3s","year":"1996","unstructured":"J. Koml\u00f3s and E. Szemer\u00e9di: Topological cliques in graphs II, Combin. Probab. Comput.\n                           5 (1996), 79\u201390.","journal-title":"Combin. Probab. Comput."},{"key":"2475_CR34","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1002\/jgt.1014","volume":"37","author":"A. Kostochka","year":"2001","unstructured":"A. Kostochka and V. R\u00f6dl: On graphs with small Ramsey numbers, J. Graph Theory\n                           37 (2001), 198\u2013204.","journal-title":"J. Graph Theory"},{"issue":"3","key":"2475_CR35","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s00493-004-0024-9","volume":"24","author":"A. Kostochka","year":"2004","unstructured":"A. Kostochka and V. R\u00f6dl: On graphs with small Ramsey numbers II, Combinatorica\n                           24(3) (2004), 389\u2013401.","journal-title":"Combinatorica"},{"key":"2475_CR36","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/j.jcta.2005.12.007","volume":"113","author":"A. Kostochka","year":"2006","unstructured":"A. Kostochka and V. R\u00f6dl: On Ramsey numbers of uniform hypergraphs with given maximum degree, J. Combin. Theory Ser. A\n                           113 (2006), 1555\u20131564.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2475_CR37","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1017\/S0963548303005728","volume":"12","author":"A. Kostochka","year":"2003","unstructured":"A. Kostochka and B. Sudakov: On Ramsey numbers of sparse graphs, Combin. Probab. Comput.\n                           12 (2003), 627\u2013641.","journal-title":"Combin. Probab. Comput."},{"key":"2475_CR38","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u0151v\u00e1ri","year":"1954","unstructured":"T. K\u0151v\u00e1ri, V. T. S\u00f3s and P. Tur\u00e1n: On a problem of K. Zarankiewicz, Colloq Math.\n                           3 (1954), 50\u201357.","journal-title":"Colloq Math."},{"key":"2475_CR39","doi-asserted-by":"crossref","unstructured":"M. Krivelevich and B. Sudakov: Pseudo-random graphs, in: More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies 15, Springer, 2006, 199\u2013262.","DOI":"10.1007\/978-3-540-32439-3_10"},{"key":"2475_CR40","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/PL00009322","volume":"18","author":"L. Lov\u00e1sz","year":"1997","unstructured":"L. Lov\u00e1sz, J. Pach and M. Szegedy: On Conway\u2019s thrackle conjecture, Discrete Comput. Geom.\n                           18 (1997), 369\u2013376.","journal-title":"Discrete Comput. Geom."},{"key":"2475_CR41","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1017\/S0963548306007723","volume":"15","author":"V. Nikiforov","year":"2006","unstructured":"V. Nikiforov: Edge distribution of graphs with few copies of a given graph, Combin. Probab. Comput.\n                           15 (2006), 895\u2013902.","journal-title":"Combin. Probab. Comput."},{"key":"2475_CR42","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/jcta.2001.3184","volume":"96","author":"J. Pach","year":"2001","unstructured":"J. Pach and J. Solymosi: Crossing patterns of segments, J. Combin. Theory Ser. A\n                           96 (2001), 316\u2013325.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2475_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-540-30540-8_15","volume-title":"Combinatorial Geometry and Graph Theory","author":"J. Pach","year":"2005","unstructured":"J. Pach and G. T\u00f3th: Disjoint edges in topological graphs, in: Combinatorial Geometry and Graph Theory (J. Akiyama et al., eds.), Lecture Notes in Computer Science 3330, Springer-Verlag, Berlin, 2005, 133\u2013140."},{"key":"2475_CR44","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F. P. Ramsey","year":"1930","unstructured":"F. P. Ramsey: On a problem of formal logic, Proc. London Math. Soc.\n                           30 (1930), 264\u2013286.","journal-title":"Proc. London Math. Soc."},{"key":"2475_CR45","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0012-365X(86)90076-2","volume":"59","author":"V. R\u00f6dl","year":"1986","unstructured":"V. R\u00f6dl: On universality of graphs with uniformly distributed edges, Discrete Math.\n                           59 (1986), 125\u2013134.","journal-title":"Discrete Math."},{"key":"2475_CR46","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/rsa.1021","volume":"19","author":"L. Shi","year":"2001","unstructured":"L. Shi: Cube Ramsey numbers are polynomial, Random Structures & Algorithms\n                           19 (2001), 99\u2013101.","journal-title":"Random Structures & Algorithms"},{"key":"2475_CR47","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02988307","volume":"9","author":"A. F. Sidorenko","year":"1993","unstructured":"A. F. Sidorenko: A correlation inequality for bipartite graphs, Graphs Combin.\n                           9 (1993), 201\u2013204.","journal-title":"Graphs Combin."},{"key":"2475_CR48","first-page":"419","volume-title":"Progress in graph theory","author":"M. Simonovits","year":"1984","unstructured":"M. Simonovits: Extremal graph problems, degenerate extremal problems and supersaturated graphs; in: Progress in graph theory (J. A. Bondy ed.), Academic, New York, 1984, 419\u2013437."},{"key":"2475_CR49","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0095-8956(02)00038-2","volume":"88","author":"B. Sudakov","year":"2003","unstructured":"B. Sudakov: Few remarks on the Ramsey-Tur\u00e1n-type problems, J. Combin. Theory Ser. B\n                           88 (2003), 99\u2013106.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2475_CR50","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/rsa.20035","volume":"26","author":"B. Sudakov","year":"2005","unstructured":"B. Sudakov: Large K\n                           r-free subgraphs in K\n                           s-free graphs and some other Ramsey-type problems, Random Structures & Algorithms\n                           26 (2005), 253\u2013265.","journal-title":"Random Structures & Algorithms"},{"key":"2475_CR51","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 Arithmetica\n                           27 (1975), 199\u2013245.","journal-title":"Acta Arithmetica"},{"key":"2475_CR52","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1112\/jlms\/s2-39.2.246","volume":"39","author":"A. Thomason","year":"1989","unstructured":"A. Thomason: A disproof of a conjecture of Erd\u0151s in Ramsey theory, J. Lond. Math. Soc.\n                           39 (1989), 246\u2013255.","journal-title":"J. Lond. Math. Soc."},{"key":"2475_CR53","first-page":"212","volume":"15","author":"B. L. Waerden van der","year":"1927","unstructured":"B. L. van der Waerden: Beweis einer Baudet\u2019schen Vermutung, Nieuw. Arch. Wisk.\n                           15 (1927), 212\u2013216.","journal-title":"Nieuw. Arch. Wisk."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2475-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2475-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2475-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T22:43:32Z","timestamp":1576104212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2475-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["2475"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2475-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}