{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:22:04Z","timestamp":1783984924603,"version":"3.55.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"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":[[2013,4]]},"DOI":"10.1007\/s00493-013-2778-4","type":"journal-article","created":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T10:34:20Z","timestamp":1371465260000},"page":"125-160","source":"Crossref","is-referenced-by-count":43,"title":["Ramsey-goodness\u2014and otherwise"],"prefix":"10.1007","volume":"33","author":[{"given":"Peter","family":"Allen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Graham","family":"Brightwell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jozef","family":"Skokan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,6,14]]},"reference":[{"key":"2778_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1017\/S0963548308009164","volume":"17","author":"P Allen","year":"2008","unstructured":"P. Allen: Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles, Combin. Probab. Comput. 17 (2008), 471\u2013486.","journal-title":"Combin. Probab. Comput."},{"key":"2778_CR2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K Appel","year":"1977","unstructured":"K. Appel and W. Haken: Every planar map is four colorable. Part I. Discharging, Illinois J. Math. 21 (1977), 429\u2013490.","journal-title":"Illinois J. Math."},{"key":"2778_CR3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1215\/ijm\/1256049012","volume":"21","author":"K Appel","year":"1977","unstructured":"K. Appel, W. Haken and J. Koch: Every planar map is four colorable. Part II. Reducibility, Illinois J. Math. 21 (1977), 491\u2013567.","journal-title":"Illinois J. Math."},{"key":"2778_CR4","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/S0095-8956(73)80005-X","volume":"14","author":"J A Bondy","year":"1973","unstructured":"J. A. Bondy, P. Erd\u0151s: Ramsey numbers for cycles in graphs, J. Combinatorial Theory Ser. B 14 (1973), 46\u201354.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"2778_CR5","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. W\u00fcrfl: Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs, Eur. J. Comb. 31 (2010), 1217\u20131227.","journal-title":"Eur. J. Comb."},{"key":"2778_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00208-008-0268-6","volume":"3431","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, Mathematische Annalen 343(1) (2009), 175\u2013205.","journal-title":"Mathematische Annalen"},{"key":"2778_CR7","volume-title":"Expanding graphs and Ramsey numbers, available at Freie Universit\u00e4at","author":"S Brandt","year":"1996","unstructured":"S. Brandt: Expanding graphs and Ramsey numbers, available at Freie Universit\u00e4at, Berlin preprint server, ftp:\/\/ftp.math.fu-berlin.de\/pub\/math\/publ\/pre\/1996\/pr-a-96-24.ps (1996)."},{"key":"2778_CR8","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":"2778_CR9","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. 24 (1981), 405\u2013413.","journal-title":"J. London Math. Soc."},{"key":"2778_CR10","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":"2778_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":"2778_CR12","first-page":"163","volume-title":"Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984)","author":"S A Burr","year":"1985","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, R. H. Schelp: The Ramsey number for the pair complete bipartite graph-graph of limited degree, Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), 163\u2013174, Wiley, New York, 1985."},{"key":"2778_CR13","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. H. Schelp: Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B 57 (1993), 138\u2013149.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2778_CR14","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 number, J. Graph Theory 1 (1977), 93.","journal-title":"J. Graph Theory"},{"key":"2778_CR15","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":"2778_CR16","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: The Ramsey number of a graph with a bounded maximum degree, J. Combin. Theory Ser. B 34 (1983) 239\u2013243.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2778_CR17","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":"2778_CR18","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00493-012-2710-3","volume":"32","author":"D Conlon","year":"2012","unstructured":"D. Conlon, J. Fox and B. Sudakov: On two problems in graph Ramsey theory, Combinatorica 32 (2012), 513\u2013535.","journal-title":"Combinatorica"},{"key":"2778_CR19","series-title":"Graduate Texts in Mathematics","volume-title":"Graph theory","author":"R Diestel","year":"2005","unstructured":"R. Diestel: Graph theory, third ed., Graduate Texts in Mathematics, vol. 173, Springer-Verlag, Berlin, 2005.","edition":"third ed."},{"key":"2778_CR20","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":"2778_CR21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/jgt.3190020107","volume":"2","author":"P Erd\u0151s","year":"1978","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau and R. H. Schelp: On cycle-complete graph Ramsey numbers, J. Graph Theory 2 (1978), 53\u201364.","journal-title":"J. Graph Theory"},{"key":"2778_CR22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s and T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337\u2013356.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2778_CR23","first-page":"464","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres: A combinatorial problem in geometry, Composito Math. 2 (1935), 464\u2013470.","journal-title":"Composito Math."},{"key":"2778_CR24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(74)90151-4","volume":"8","author":"R J Faudree","year":"1974","unstructured":"R. J. Faudree and R. H. Schelp: All Ramsey numbers for cycles in graphs, Discrete Math. 8 (1974), 313\u2013329.","journal-title":"Discrete Math."},{"key":"2778_CR25","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":"2778_CR26","first-page":"167","volume":"10","author":"L Gerencs\u00e9r","year":"1967","unstructured":"L. Gerencs\u00e9r and A. Gy\u00e1rf\u00e1s: On Ramsey-type problems, Annales Universitatis Scientiarum Budapestinensis, E\u00f6tv\u00f6s Sect. Math. 10 (1967), 167\u2013170.","journal-title":"E\u00f6tv\u00f6s Sect. Math."},{"key":"2778_CR27","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":"2778_CR28","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: Planar graph coloring with an uncooperative partner, J. Graph Theory 18 (1994), 569\u2013584.","journal-title":"J. Graph Theory"},{"key":"2778_CR29","unstructured":"Y. Kohayakawa, M. Simonovits and J. Skokan: The 3-coloured Ramsey number of odd cycles, J. Combin. Theory Ser. B, to appear."},{"key":"2778_CR30","volume-title":"Stability of Ramsey numbers for cycles","author":"Y Kohayakawa","year":"2008","unstructured":"Y. Kohayakawa, M. Simonovits and J. Skokan: Stability of Ramsey numbers for cycles, manuscript, 2008."},{"key":"2778_CR31","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J Koml\u00f3s","year":"1997","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: Blow-up lemma, Combinatorica 17 (1997), 109\u2013123.","journal-title":"Combinatorica"},{"key":"2778_CR32","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. S\u00f3s and P. Tur\u00e1n: On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50\u201357.","journal-title":"Colloquium Math."},{"key":"2778_CR33","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1017\/S096354830400642X","volume":"14","author":"V Nikiforov","year":"2005","unstructured":"V. Nikiforov: The cycle-complete graph Ramsey numbers, Combin. Probab. Comput. 14 (2005), 349\u2013370.","journal-title":"Combin. Probab. Comput."},{"key":"2778_CR34","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":"2778_CR35","unstructured":"S. P. Radziszowski: Small Ramsey numbers, Electronic J. Combin DS1 (2006), 60pp."},{"key":"2778_CR36","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(73)90035-X","volume":"15","author":"V Rosta","year":"1973","unstructured":"V. Rosta: On a Ramsey-type problem of J. A. Bondy and P. Erd\u0151s. I, II, J. Combin. Theory Ser. B 15 (1973), 94\u2013105 and 105\u2013120.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2778_CR37","unstructured":"G. S\u00e1rk\u00f6zy, M. Schacht and A. Taraz: Two and three colour Ramsey numbers for bipartite graphs with small bandwidth, in preparation."},{"key":"2778_CR38","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N Sauer","year":"1978","unstructured":"N. Sauer and J. Spencer: Edge disjoint placement of graphs, J. Combin. Theory Ser. B 25 (1978), 295\u2013302.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2778_CR39","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0012-365X(77)90044-9","volume":"20","author":"J Spencer","year":"1977","unstructured":"J. Spencer: Asymptotic lower bounds for Ramsey functions, Discrete Math. 20 (1977), 69\u201376.","journal-title":"Discrete Math."},{"key":"2778_CR40","first-page":"399","volume-title":"Regular partitions of graphs, Colloques Internationaux C.N.R.S. Vol. 260","author":"E Szemer\u00e9di","year":"1976","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, Colloques Internationaux C.N.R.S. Vol. 260, in Probl\u00e9mes Combinatoires et Th\u00e9orie des Graphes, Orsay (1976), 399\u2013401."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2778-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-013-2778-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2778-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T16:17:37Z","timestamp":1595953057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-013-2778-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["2778"],"URL":"https:\/\/doi.org\/10.1007\/s00493-013-2778-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}