{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:39:28Z","timestamp":1768732768698,"version":"3.49.0"},"reference-count":31,"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-2409-2","type":"journal-article","created":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T22:43:11Z","timestamp":1576104191000},"page":"227-262","source":"Crossref","is-referenced-by-count":41,"title":["Ramsey goodness and beyond"],"prefix":"10.1007","volume":"29","author":[{"given":"Vladimir","family":"Nikiforov","sequence":"first","affiliation":[]},{"given":"Cecil C.","family":"Rousseau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,24]]},"reference":[{"issue":"3","key":"2409_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90133-2","volume":"8","author":"B. Andr\u00e1sfai","year":"1974","unstructured":"B. Andr\u00e1sfai, P. Erd\u0151s and V. T. S\u00f3s: On the connection between chromatic number, maximal clique and minimal degree of a graph, Discrete Math. 8(3) (1974), 205\u2013218.","journal-title":"Discrete Math"},{"key":"2409_CR2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"B. Bollob\u00e1s: Modern Graph Theory, Graduate Texts in Mathematics 184, Springer-Verlag, New York (1998), xiv+394 pp."},{"key":"2409_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.disc.2007.03.045","volume":"308","author":"B. Bollob\u00e1s","year":"2008","unstructured":"B. Bollob\u00e1s and V. Nikiforov: Joints in graphs, Discrete Math. 308 (2008), 9\u201319.","journal-title":"Discrete Math"},{"key":"2409_CR4","unstructured":"S. Brandt: Expanding graphs and Ramsey numbers, available at Bielefeld preprint server, (1996), Preprint No. A 96-24."},{"key":"2409_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01788524","volume":"3","author":"S. A. Burr","year":"1987","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, R. H. Schelp, R. J. Gould and M. S. Jacobson: Goodness of trees for generalized books, Graphs Combin.\n                           3 (1987), 1\u20136.","journal-title":"Graphs Combin."},{"key":"2409_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/jgt.3190070404","volume":"7","author":"S. A. Burr","year":"1983","unstructured":"S. A. Burr, R. J. Faudree, C. C. Rousseau and R. H. Schelp: On Ramsey numbers involving starlike multipartite graphs, J. Graph Theory\n                           7 (1983), 395\u2013409.","journal-title":"J. Graph Theory"},{"key":"2409_CR7","doi-asserted-by":"publisher","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\n                           7 (1983), 39\u201351.","journal-title":"J. Graph Theory"},{"key":"2409_CR8","doi-asserted-by":"publisher","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)\n                           24 (1981), 405\u2013413.","journal-title":"J. London Math. Soc. (2)"},{"key":"2409_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0012-365X(82)90183-2","volume":"40","author":"S. A. Burr","year":"1982","unstructured":"S. A. Burr: Multicolor Ramsey numbers involving graphs with long suspended paths, Discrete Math. 40 (1982), 11\u201320.","journal-title":"Discrete Math"},{"key":"2409_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(87)90172-5","volume":"67","author":"S. A. Burr","year":"1987","unstructured":"S. A. Burr: What we can hope to accomplish in generalized Ramsey theory, Discrete Math. 67 (1987), 215\u2013225.","journal-title":"Discrete Math"},{"issue":"4","key":"2409_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02579245","volume":"5","author":"P. Erd\u0151s","year":"1985","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau and R. H. Schelp: Multipartite graph \u2014 sparse graph Ramsey numbers, Combinatorica\n                           5(4) (1985), 311\u2013318.","journal-title":"Combinatorica"},{"key":"2409_CR12","first-page":"111","volume":"1","author":"P. Erd\u0151s","year":"1988","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau and R. H. Schelp: The book-tree Ramsey numbers, Scientia, Series A: Mathematical Sciences\n                           1 (1988), 111\u2013117.","journal-title":"Scientia, Series A: Mathematical Sciences"},{"key":"2409_CR13","first-page":"289","volume-title":"Congress. Numer. XXI","author":"R. J. Faudree","year":"1978","unstructured":"R. J. Faudree, C. C. Rousseau and J. Sheehan: More from the good book, Congress. Numer. XXI, Utilitas Math., Winnipeg, Man., 1978, pp. 289\u2013299."},{"key":"2409_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0024-3795(82)90037-4","volume":"46","author":"R. J. Faudree","year":"1982","unstructured":"R. J. Faudree, C. C. Rousseau and J. Sheehan: Strongly regular graphs and finite Ramsey theory, Linear Algebra Appl. 46 (1982), 221\u2013241.","journal-title":"Linear Algebra Appl"},{"key":"2409_CR15","first-page":"180","volume-title":"Graph theory, combinatorics, algorithms, and applications","author":"R. J. Faudree","year":"1991","unstructured":"R. J. Faudree, C. C. Rousseau and R. H. Schelp: A good idea in Ramsey theory, in: Graph theory, combinatorics, algorithms, and applications (San Francisco, CA, 1989), pp. 180\u2013189, SIAM, Philadelphia, PA, 1991."},{"key":"2409_CR16","first-page":"239","volume":"31","author":"R. J. Faudree","year":"1991","unstructured":"R. J. Faudree, C. C. Rousseau and J. Sheehan: Cycle-book Ramsey numbers, Ars Combin. 31 (1991), 239\u2013248.","journal-title":"Ars Combin"},{"key":"2409_CR17","first-page":"351","volume-title":"The theory and applications of graphs","author":"R. J. Faudree","year":"1981","unstructured":"R. J. Faudree, R. H. Schelp and C. C. Rousseau: Generalizations of a Ramsey result of Chv\u00e1tal, in: The theory and applications of graphs (Kalamazoo, Mich., 1980), pp. 351\u2013361, Wiley, New York, 1981."},{"key":"2409_CR18","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), Bolyai Soc. Math. Stud., 2, J\u00e1nos Bolyai Math. Soc., Budapest, 1996, pp. 295\u2013352."},{"key":"2409_CR19","doi-asserted-by":"publisher","first-page":"109","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), 109\u2013204.","journal-title":"J. Graph Theory"},{"issue":"1","key":"2409_CR20","doi-asserted-by":"publisher","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\n                           17(1) (1997), 109\u2013123.","journal-title":"Combinatorica"},{"key":"2409_CR21","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/(SICI)1097-0118(199612)23:4<413::AID-JGT10>3.0.CO;2-D","volume":"23","author":"Y. Li","year":"1996","unstructured":"Y. Li and C. C. Rousseau: Fan-complete graph Ramsey numbers, J. Graph Theory\n                           23 (1996), 413\u2013420.","journal-title":"J. Graph Theory"},{"key":"2409_CR22","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 induced copies of a given graph, Combin. Probab. Comput.\n                           15 (2006), 895\u2013902.","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"2409_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1112\/blms\/bdm093","volume":"40","author":"V. Nikiforov","year":"2008","unstructured":"V. Nikiforov: Graphs with many r-cliques have large complete r-partite subgraphs, Bull. London Math. Soc.\n                           40(1) (2008), 23\u201325.","journal-title":"Bull. London Math. Soc."},{"issue":"1","key":"2409_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jctb.2004.03.009","volume":"92","author":"V. Nikiforov","year":"2004","unstructured":"V. Nikiforov and C. C. Rousseau: Large generalized books are p-good, J. Combin. Theory Ser. B\n                           92(1) (2004), 85\u201397.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2409_CR25","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1002\/jgt.20071","volume":"49","author":"V. Nikiforov","year":"2005","unstructured":"V. Nikiforov and C. C. Rousseau: A note on Ramsey numbers for books, J. Graph Theory\n                           49 (2005), 168\u2013176.","journal-title":"J. Graph Theory"},{"key":"2409_CR26","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/rsa.20081","volume":"27","author":"V. Nikiforov","year":"2005","unstructured":"V. Nikiforov and C. C. Rousseau: Book Ramsey numbers I, Random Structures Algorithms\n                           27 (2005), 379\u2013400.","journal-title":"Random Structures Algorithms"},{"key":"2409_CR27","unstructured":"V. Nikiforov and C. C. Rousseau: Ramsey Goodness and Beyond, preprint available at arXiv:math\/0703653."},{"key":"2409_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/jgt.3190020110","volume":"2","author":"C. C. Rousseau","year":"1978","unstructured":"C. C. Rousseau and J. Sheehan: On Ramsey numbers for books, J. Graph Theory\n                           2 (1978), 77\u201387.","journal-title":"J. Graph Theory"},{"key":"2409_CR29","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1112\/jlms\/s2-18.3.392","volume":"18","author":"C. C. Rousseau","year":"1978","unstructured":"C. C. Rousseau and J. Sheehan: A class of Ramsey problems involving trees, J. London Math. Soc. (2)\n                           18 (1978), 392\u2013396.","journal-title":"J. London Math. Soc. (2)"},{"key":"2409_CR30","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":"2409_CR31","first-page":"399","volume-title":"Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976)","author":"E. Szemer\u00e9di","year":"1978","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, in: Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 399\u2013401, 260, CNRS, Paris, 1978."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2409-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2409-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2409-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T22:43:18Z","timestamp":1576104198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2409-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["2409"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2409-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}