{"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":1775861642818,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"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":[[2012,5]]},"DOI":"10.1007\/s00493-012-2710-3","type":"journal-article","created":{"date-parts":[[2012,10,4]],"date-time":"2012-10-04T03:04:01Z","timestamp":1349319841000},"page":"513-535","source":"Crossref","is-referenced-by-count":29,"title":["On two problems in graph Ramsey theory"],"prefix":"10.1007","volume":"32","author":[{"given":"David","family":"Conlon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Fox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,4]]},"reference":[{"key":"2710_CR1","doi-asserted-by":"crossref","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. 12 (2003), 477\u2013494.","journal-title":"Combin. Probab. Comput."},{"key":"2710_CR2","first-page":"215","volume-title":"Infinite and Finite Sets, Vol. 1","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, Vol. 1 (Keszthely, 1973), Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10, North-Holland, Amsterdam\/London, 1975, 215\u2013240."},{"key":"2710_CR3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1006\/jctb.1993.1012","volume":"57","author":"G. Chen","year":"1993","unstructured":"G. Chen and R. Schelp, Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B 57 (1993), 138\u2013149.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2710_CR4","doi-asserted-by":"crossref","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 34 (1983), 239\u2013243.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2710_CR5","doi-asserted-by":"crossref","first-page":"941","DOI":"10.4007\/annals.2009.170.941","volume":"170","author":"D. Conlon","year":"2009","unstructured":"D. Conlon: A new upper bound for diagonal Ramsey numbers, Annals of Math. 170 (2009), 941\u2013960.","journal-title":"Annals of Math."},{"key":"2710_CR6","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1017\/S0963548309990174","volume":"18","author":"D. Conlon","year":"2009","unstructured":"D. Conlon: Hypergraph packing and sparse bipartite Ramsey numbers, Combin. Probab. Comput., 18 (2009), 913\u2013923.","journal-title":"Combin. Probab. Comput."},{"key":"2710_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20260","volume":"35","author":"D. Conlon","year":"2009","unstructured":"D. Conlon, J. Fox and B. Sudakov: Ramsey numbers of sparse hypergraphs, Random Structures Algorithms 35 (2009), 1\u201314.","journal-title":"Random Structures Algorithms"},{"key":"2710_CR8","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.jctb.2007.08.008","volume":"98","author":"O. Cooley","year":"2008","unstructured":"O. Cooley, N. Fountoulakis, D. K\u00fchn and D. Osthus: 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, J. Combin. Theory Ser. B 98 (2008), 484\u2013505.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2710_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00493-009-2356-y","volume":"28","author":"O. Cooley","year":"2009","unstructured":"O. Cooley, N. Fountoulakis, D. K\u00fchn and D. Osthus: Embeddings and Ramsey numbers of sparse k-uniform hypergraphs, Combinatorica 28 (2009), 263\u2013297.","journal-title":"Combinatorica"},{"key":"2710_CR10","first-page":"323","volume-title":"Infinite and Finite Sets, Vol. 1","author":"W. Deuber","year":"1975","unstructured":"W. Deuber: A generalization of Ramsey\u2019s theorem, in: Infinite and Finite Sets, Vol. 1 (Keszthely, 1973), Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10, North-Holland, Amsterdam\/London, 1975, 323\u2013332."},{"key":"2710_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0012-365X(97)00184-2","volume":"185","author":"N. Eaton","year":"1998","unstructured":"N. Eaton: Ramsey numbers for sparse graphs, Discrete Math. 185 (1998), 63\u201375.","journal-title":"Discrete Math."},{"key":"2710_CR12","first-page":"1","volume-title":"Graph theory and combinatorics","author":"P. Erd\u0151s","year":"1984","unstructured":"P. Erd\u0151s: On some problems in graph theory, combinatorial analysis and combinatorial number theory, in: Graph theory and combinatorics (Cambridge, 1983), Academic Press, London, New York, 1984, 1\u201317."},{"key":"2710_CR13","first-page":"183","volume-title":"Recent advances in graph theory","author":"P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s: Problems and results on finite and infinite graphs, in: Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), Academia, Prague, 1975, 183\u2013192."},{"key":"2710_CR14","doi-asserted-by":"crossref","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. 53 (1947), 292\u2013294.","journal-title":"Bull. Amer. Math. Soc."},{"key":"2710_CR15","first-page":"515","volume-title":"Infinite and Finite Sets, Vol. 1","author":"P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s and R. Graham: On partition theorems for finite graphs, in: Infinite and Finite Sets, Vol. 1 (Keszthely, 1973), Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10, North-Holland, Amsterdam\/London, 1975, 515\u2013527."},{"key":"2710_CR16","first-page":"585","volume-title":"Infinite and Finite Sets, Vol. 1","author":"P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s, A. Hajnal and L. P\u00f3sa: Strong embeddings of graphs into colored graphs, in: Infinite and Finite Sets, Vol. 1 (Keszthely, 1973), Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10, North-Holland, Amsterdam\/London, 1975, 585\u2013595."},{"key":"2710_CR17","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. 2 (1935), 463\u2013470.","journal-title":"Compositio Math."},{"key":"2710_CR18","doi-asserted-by":"crossref","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. 219 (2008), 1771\u20131800.","journal-title":"Adv. Math."},{"key":"2710_CR19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00493-009-2475-5","volume":"29","author":"J. Fox","year":"2009","unstructured":"J. Fox and B. Sudakov: Density theorems for bipartite graphs and related Ramsey-type results, Combinatorica 29 (2009), 153\u2013196.","journal-title":"Combinatorica"},{"key":"2710_CR20","doi-asserted-by":"crossref","first-page":"1630","DOI":"10.1016\/j.ejc.2009.03.004","volume":"30","author":"J. Fox","year":"2009","unstructured":"J. Fox and B. Sudakov: Two remarks on the Burr-Erd\u0151s conjecture, European J. Combin. 30 (2009), 1630\u20131645.","journal-title":"European J. Combin."},{"key":"2710_CR21","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. 7 (1997), 322\u2013337.","journal-title":"Geom. Funct. Anal."},{"key":"2710_CR22","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1002\/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C","volume":"35","author":"R. L. Graham","year":"2000","unstructured":"R. L. Graham, V. R\u00f6dl and A. Ruci\u0144ski: On graphs with linear Ramsey numbers, J. Graph Theory 35 (2000), 176\u2013192.","journal-title":"J. Graph Theory"},{"key":"2710_CR23","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s004930100018","volume":"21","author":"R. L. Graham","year":"2001","unstructured":"R. L. Graham, V. R\u00f6dl and A. Ruci\u0144ski: On bipartite graphs with linear Ramsey numbers, Combinatorica 21 (2001), 199\u2013209.","journal-title":"Combinatorica"},{"key":"2710_CR24","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1002\/jgt.3190180605","volume":"18","author":"H. A. Kierstead","year":"1994","unstructured":"H. A. Kierstead and W. T. Trotter Jr.: Planar graph colorings with an uncooperative partner, J. Graph Theory 18 (1994), 569\u2013584.","journal-title":"J. Graph Theory"},{"key":"2710_CR25","doi-asserted-by":"crossref","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 18 (1998), 373\u2013404.","journal-title":"Combinatorica"},{"key":"2710_CR26","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1017\/S0963548303005728","volume":"12","author":"A. V. Kostochka","year":"2003","unstructured":"A. V. Kostochka and B. Sudakov: On Ramsey numbers of sparse graphs, Combin. Probab. Comput. 12 (2003), 627\u2013641.","journal-title":"Combin. Probab. Comput."},{"key":"2710_CR27","doi-asserted-by":"crossref","unstructured":"M. Krivelevich and B. Sudakov: Pseudorandom graphs, in: More Sets, Graphs and Numbers, Bolyai Soc. Math. Stud. 15, Springer, 2006, 199\u2013262.","DOI":"10.1007\/978-3-540-32439-3_10"},{"key":"2710_CR28","first-page":"237","volume":"1","author":"L. Lov\u00e1sz","year":"1966","unstructured":"L. Lov\u00e1sz: On decomposition of graphs, Studia Sci. Math. Hungar. 1 (1966), 237\u2013238.","journal-title":"Studia Sci. Math. Hungar."},{"key":"2710_CR29","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00373-008-0784-x","volume":"27","author":"B. Nagle","year":"2008","unstructured":"B. Nagle, S. Olsen, V. R\u00f6dl and M. Schacht: On the Ramsey number of sparse 3-graphs, Graphs Combin. 27 (2008), 205\u2013228.","journal-title":"Graphs Combin."},{"key":"2710_CR30","doi-asserted-by":"crossref","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. Ser. 2 30 (1930), 264\u2013286.","journal-title":"Proc. London Math. Soc. Ser. 2"},{"key":"2710_CR31","unstructured":"V. R\u00f6dl: The dimension of a graph and generalized Ramsey theorems, Master\u2019s thesis, Charles University, 1973."},{"key":"2710_CR32","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0097-3165(75)90071-0","volume":"18","author":"J. Spencer","year":"1975","unstructured":"J. Spencer: Ramsey\u2019s theorem \u2014 a new lower bound, J. Combin. Theory Ser. A 18 (1975), 108\u2013115.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2710_CR33","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/j.aim.2011.02.004","volume":"227","author":"B. Sudakov","year":"2011","unstructured":"B. Sudakov: A conjecture of Erd\u0151s on graph Ramsey numbers, Adv. Math. 227 (2011), 601\u2013609.","journal-title":"Adv. Math."},{"key":"2710_CR34","series-title":"Colloq. Internat. CNRS","first-page":"399","volume-title":"Probl\u00e9mes Combinatoires et Th\u00e9orie des Graphes","author":"E. Szemer\u00e9di","year":"1978","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, in: Probl\u00e9mes Combinatoires et Th\u00e9orie des Graphes (Orsay 1976), Colloq. Internat. CNRS, 260, CNRS, Paris, 1978, 399\u2013401."},{"key":"2710_CR35","first-page":"307","volume-title":"Random graphs\u2019 85","author":"A. Thomason","year":"1987","unstructured":"A. Thomason: Pseudorandom graphs, in: Random graphs\u2019 85 (Pozna\u0144, 1985), North-Holland Math. Stud., Vol. 144, North-Holland, Amsterdam, 1987, 307\u2013331."},{"key":"2710_CR36","first-page":"173","volume-title":"Surveys in Combinatorics 1987","author":"A. Thomason","year":"1987","unstructured":"A. Thomason: Random graphs, strongly regular graphs and pseudorandom graphs, in: Surveys in Combinatorics 1987, London Math. Soc. Lecture Note Ser., Vol. 123, Cambridge Univ. Press, Cambridge, 1987, 173\u2013195."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2710-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2710-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2710-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T12:35:18Z","timestamp":1594730118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2710-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["2710"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2710-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}