{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:42:26Z","timestamp":1648860146807},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,5]],"date-time":"2014-11-05T00:00:00Z","timestamp":1415145600000},"content-version":"tdm","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":[[2016,2]]},"DOI":"10.1007\/s00493-014-3010-x","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T17:49:54Z","timestamp":1415987394000},"page":"37-70","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ramsey numbers of cubes versus cliques"],"prefix":"10.1007","volume":"36","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":"Choongbum","family":"Lee","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":[[2014,11,5]]},"reference":[{"key":"3010_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00493-013-2778-4","volume":"33","author":"P. Allen","year":"2013","unstructured":"P. Allen, G. Brightwell and J. Skokan: Ramsey-goodness \u2014 and otherwise, Combinatorica 33 (2013), 125\u2013160.","journal-title":"Combinatorica"},{"key":"3010_CR2","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1090\/S0894-0347-1990-1065053-0","volume":"3","author":"N. Alon","year":"1990","unstructured":"N. Alon, P. Seymour and R. Thomas: A separator theorem for nonplanar graphs, J. Amer. Math. Soc. 3 (1990), 801\u2013808.","journal-title":"J. Amer. Math. Soc."},{"key":"3010_CR3","first-page":"401","volume":"18","author":"J. Beck","year":"1983","unstructured":"J. Beck: An upper bound for diagonal Ramsey numbers, Studia Sci. Math. Hungar. 18 (1983), 401\u2013406.","journal-title":"Studia Sci. Math. Hungar."},{"key":"3010_CR4","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/j.ejc.2009.10.010","volume":"31","author":"J. B\u00f6ttcher","year":"2010","unstructured":"J. B\u00f6ttcher, K. Pruessman, A. Taraz and A. \u00fcrfl: Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs, European J. Combin. 31 (2010), 1217\u20131227.","journal-title":"European J. Combin."},{"key":"3010_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00208-008-0268-6","volume":"343","author":"J. B\u00f6ttcher","year":"2009","unstructured":"J. B\u00f6ttcher, M. Schacht and A. Taraz: Proof of the bandwidth conjecture of Bollob\u00e1s and Koml\u00f3s, Math. Ann. 343 (2009), 175\u2013205.","journal-title":"Math. Ann."},{"key":"3010_CR6","volume-title":"Expanding graphs and Ramsey numbers","author":"S. Brandt","year":"1996","unstructured":"S. Brandt: Expanding graphs and Ramsey numbers, available at Freie Universit\u00e4t, Berlin preprint server, ftp:\/\/ftp.math.fuerlin.de\/pub\/math\/publ\/pre\/1996\/pr-a-96-24.ps (1996)."},{"key":"3010_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"W. G. Brown","year":"1966","unstructured":"W. G. Brown: On graphs that do not contain a Thomsen graph, Canad. Math. Bull. 9 (1966), 281\u2013285.","journal-title":"Canad. Math. Bull."},{"key":"3010_CR8","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1112\/jlms\/s2-24.3.405","volume":"24","author":"S. A. Burr","year":"1981","unstructured":"S. A. Burr: Ramsey numbers involving graphs with long suspended paths, J. London Math. Soc. (2) 24 (1981), 405\u2013413.","journal-title":"J. London Math. Soc. (2)"},{"key":"3010_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(87)90172-5","volume":"67","author":"S. A. Burr","year":"1987","unstructured":"S. A. Burr: What can we hope to accomplish in generalized Ramsey theory?, Discrete Math. 67 (1987), 215\u2013225.","journal-title":"Discrete Math."},{"key":"3010_CR10","first-page":"214","volume":"10","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 (Keszthely, 1973), Colloq. Math. Soc. Janos Bolyai, Vol. 10, 214\u2013240, North-Holland, Amsterdam, 1975.","journal-title":"Infinite and Finite Sets I"},{"key":"3010_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/jgt.3190070106","volume":"7","author":"S. A. Burr","year":"1983","unstructured":"S. A. Burr and P. Erd\u0151s: Generalizations of a Ramsey-theoretic result of Chv\u00e1tal, J. Graph Theory 7 (1983), 39\u201351.","journal-title":"J. Graph Theory"},{"key":"3010_CR12","first-page":"163","volume-title":"Graph theory with applications to algorithms and computer science","author":"S. A. Burr","year":"1985","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau and R. H. Schelp: The Ramsey number for the pair complete bipartite graph-graph of limited degree, in: Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), 163\u2013174, Wiley, New York, 1985."},{"key":"3010_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0167-5060(08)70452-7","volume":"41","author":"S. A. Burr","year":"1989","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau and R. H. Schelp: Some complete bipartite graph-tree Ramsey numbers, Ann. Discrete Math. 41 (1989), 79\u201390.","journal-title":"Ann. Discrete Math."},{"key":"3010_CR14","doi-asserted-by":"crossref","DOI":"10.1201\/9781439863879","volume-title":"Erd\u0151s on Graphs. His Legacy of Unsolved Problems","author":"F. Chung","year":"1998","unstructured":"F. Chung and R. L. Graham: Erd\u0151s on Graphs. His Legacy of Unsolved Problems, A K Peters, Ltd., Wellesley, MA, 1998."},{"key":"3010_CR15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/jgt.3190010118","volume":"1","author":"V. Chv\u00e1tal","year":"1977","unstructured":"V. Chv\u00e1tal: Tree-complete graph Ramsey numbers, J. Graph Theory 1 (1977), 93.","journal-title":"J. Graph Theory"},{"key":"3010_CR16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.2140\/pjm.1972.41.335","volume":"41","author":"V. Chv\u00e1tal","year":"1972","unstructured":"V. Chv\u00e1tal and F. Harary: Generalized Ramsey theory for graphs, III. Small off-diagonal numbers, Pacific J. Math. 41 (1972), 335\u2013345.","journal-title":"Pacific J. Math."},{"key":"3010_CR17","doi-asserted-by":"crossref","unstructured":"G. Fiz Pontiveros, S. Griffiths, R. Morris, D. Saxton and J. Skokan: On the Ramsey number of the triangle and the cube, Combinatorica, accepted.","DOI":"10.1007\/s00493-015-3089-8"},{"key":"3010_CR18","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1112\/jlms\/jdu004","volume":"89","author":"G. Fiz Pontiveros","year":"2014","unstructured":"G. Fiz Pontiveros, S. Griffiths, R. Morris, D. Saxton and J. Skokan: The Ramsey number of the clique and the hypercube, J. London Math. Soc. 89, 2014, 680\u2013702.","journal-title":"J. London Math. Soc."},{"key":"3010_CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1017\/S0963548309990459","volume":"19","author":"J. Fox","year":"2010","unstructured":"J. Fox and J. Pach: A separator theorem for string graphs and its applications, Combin. Probab. Comput. 19 (2010), 371\u2013390.","journal-title":"Combin. Probab. Comput."},{"key":"3010_CR20","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 Ramseytype results, Combinatorica 29 (2009), 153\u2013196.","journal-title":"Combinatorica"},{"key":"3010_CR21","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/rsa.20344","volume":"38","author":"J. Fox","year":"2011","unstructured":"J. Fox and B. Sudakov: Dependent random choice, Random Structures Algorithms 38 (2011), 68\u201399.","journal-title":"Random Structures Algorithms"},{"key":"3010_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":"3010_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":"3010_CR24","first-page":"37","volume":"38","author":"A. Kostochka","year":"1982","unstructured":"A. Kostochka: The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz. 38 (1982), 37\u201358.","journal-title":"Metody Diskret. Analiz."},{"key":"3010_CR25","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A. Kostochka","year":"1984","unstructured":"A. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307\u2013316.","journal-title":"Combinatorica"},{"key":"3010_CR26","doi-asserted-by":"crossref","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 37 (2001), 198\u2013204.","journal-title":"J. Graph Theory"},{"key":"3010_CR27","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton and R. E. Tarjan: A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), 177\u2013189.","journal-title":"SIAM J. Appl. Math."},{"key":"3010_CR28","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BF01350657","volume":"178","author":"W. Mader","year":"1968","unstructured":"W. Mader: Homomorphies\u00e4tze f\u00fcr Graphen, Math. Ann. 178 (1968), 154\u2013168.","journal-title":"Math. Ann."},{"key":"3010_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/256292.256294","volume":"44","author":"G. L. Miller","year":"1997","unstructured":"G. L. Miller, S.-H. Teng, W. Thurston and S. A. Vavasis: Separators for sphere-packings and nearest neighbor graphs, J. ACM 44 (1997), 1\u201329.","journal-title":"J. ACM"},{"key":"3010_CR30","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00493-009-2409-2","volume":"29","author":"V. Nikiforov","year":"2009","unstructured":"V. Nikiforov and C. C. Rousseau: Ramsey goodness and beyond, Combinatorica 29 (2009), 227\u2013262.","journal-title":"Combinatorica"},{"key":"3010_CR31","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"N. Robertson and P. D. Seymour: Graph minors. XX. Wagner\u2019s conjecture, J. Combin. Theory Ser. B 92 (2004), 325\u2013357.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3010_CR32","doi-asserted-by":"crossref","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 19 (2001), 99\u2013101.","journal-title":"Random Structures Algorithms"},{"key":"3010_CR33","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.disc.2006.07.005","volume":"307","author":"L. Shi","year":"2007","unstructured":"L. Shi: The tail is cut for Ramsey numbers of cubes, Discrete Math. 307 (2007), 290\u2013292.","journal-title":"Discrete Math."},{"key":"3010_CR34","volume-title":"Enumerative Combinatorics, Volume 1","author":"R. Stanley","year":"2002","unstructured":"R. Stanley: Enumerative Combinatorics, Volume 1, Cambridge Studies in Advanced Mathematics 49, Cambridge University Press, Cambridge, UK, 2002."},{"key":"3010_CR35","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. Thomason","year":"1984","unstructured":"A. Thomason: An extremal function for contractions of graphs, Math. Proc. Cam. Phil. Soc. 95 (1984), 261\u2013265.","journal-title":"Math. Proc. Cam. Phil. Soc."},{"key":"3010_CR36","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A. Thomason","year":"2001","unstructured":"A. Thomason: The extremal function for complete minors, J. Combin. Theory Ser. B 81 (2001), 318\u2013338.","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3010-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3010-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3010-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T20:52:56Z","timestamp":1598475176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3010-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,5]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["3010"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3010-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,5]]}}}