{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:39:17Z","timestamp":1742996357404,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":57,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461472537"},{"type":"electronic","value":"9781461472544"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4614-7254-4_8","type":"book-chapter","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T18:35:43Z","timestamp":1375382143000},"page":"95-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Problems in Graph Theory from Memphis"],"prefix":"10.1007","author":[{"given":"Ralph J.","family":"Faudree","sequence":"first","affiliation":[]},{"given":"Cecil C.","family":"Rousseau","sequence":"additional","affiliation":[]},{"given":"Richard H.","family":"Schelp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","volume":"29","author":"M. Ajtai","year":"1980","unstructured":"M. Ajtai, J. Komlos and E. Szemer\u00e9di, A note on Ramsey numbers, J. Combin. Theory Ser. A 29, (1980), 354\u2013360.","journal-title":"J. Combin. Theory Ser. A"},{"key":"8_CR2","first-page":"91","volume":"83","author":"M. O. Albertson","year":"1991","unstructured":"M. O. Albertson and D. M. Berman, Ramsey graphs without repeated degrees, Cong. Numer. 83 (1991), 91\u201396.","journal-title":"Cong. Numer."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/jgt.3190070115","volume":"7","author":"J. Beck","year":"1983","unstructured":"J. Beck, On size Ramsey numbers of paths, trees and circuits, I, J. Graph Theory 7, (1983), 115\u2013129.","journal-title":"J. Graph Theory"},{"key":"8_CR4","unstructured":"B. Bollob\u00e1s, Degree multiplicities and independent sets in K\n                4\n                -free graphs, preprint."},{"key":"8_CR5","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 and P. Erd\u0151s, Ramsey numbers for cycles in graphs, J. Combin. Theory Ser. B 14, (1973), 46\u201354.","journal-title":"J. Combin. Theory Ser. B"},{"key":"8_CR6","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":"8_CR7","doi-asserted-by":"crossref","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, R. J. Gould, M. S. Jacobson, C. C. Rousseau, and R. H. Schelp, Goodness of trees for generalized books, Graphs Combin. 3 (1987), 1\u20136.","DOI":"10.1007\/BF01788524"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey minimal graphs for multiple copies, Proc. Koninklijke, Nederlandse Akad. Van Wetenschappen, Amsterdam, Series A. 81(2) (1978), 187\u2013195.","DOI":"10.1016\/1385-7258(78)90036-7"},{"key":"8_CR9","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, and R. H. Schelp, A class of Ramsey-finite graphs, Proc. 9th S. E. Conf. on Combinatorics, Graph Theory, and Computing (1978), 171\u2013178."},{"key":"8_CR10","first-page":"193","volume":"10","author":"S. A. Burr","year":"1980","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, An extremal problem in generalized Ramsey theory, Ars Combin. 10 (1980), 193\u2013203.","journal-title":"Ars Combin."},{"key":"8_CR11","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey minimal graphs for the pair star - connected graph, Studia Scient. Math. Hungar. 15 (1980), 265\u2013273."},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0012-365X(81)90266-1","volume":"33","author":"S. A. Burr","year":"1981","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey minimal graphs for star forests, Discrete Math. 33 (1981), 227\u2013237.","journal-title":"Discrete Math."},{"key":"8_CR13","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey minimal graphs for matchings, The Theory and Applications of Graphs, G. Chartrand, editor, John Wiley (1981) 159\u2013168."},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(82)90165-0","volume":"38","author":"S. A. Burr","year":"1982","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey minimal graphs for forests, Discrete Math. 38 (1982), 23\u201332.","journal-title":"Discrete Math."},{"issue":"269","key":"8_CR15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1090\/S0002-9947-1982-0637704-5","volume":"2","author":"S. A. Burr","year":"1982","unstructured":"S. A. Burr, P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey numbers for the pair sparse graph-path or cycle, Trans. Amer. Math. Soc. 2 (269) (1982), 501\u2013512.","journal-title":"Trans. Amer. Math. Soc."},{"key":"8_CR16","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 with limited degree, Graph Theory with Applications to Algorithms and Computer Sciences G. Chartrand, ed. Wiley-Interscience, New York, (1985), 163\u2013174."},{"key":"8_CR17","doi-asserted-by":"crossref","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.","DOI":"10.1016\/S0167-5060(08)70452-7"},{"key":"8_CR18","unstructured":"S. A. Burr and R. J. Faudree, On graphsGfor which all large trees areG-good, Graphs Combin. (to appear)."},{"key":"8_CR19","unstructured":"L. Caccetta, P. Erd\u0151s, E. T. Ordman and N. J. Pullman, The difference between the clique numbers of a graph, Ars Combin. 19A (1985), 97\u2013106."},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/eujc.1993.1034","volume":"14","author":"G. Chen","year":"1993","unstructured":"G. Chen, P. Erd\u0151s, C. C. Rousseau and R. H. Schelp, Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs, European J. Combin. 14 (1993), 183\u2013189.","journal-title":"European J. Combin."},{"key":"8_CR21","unstructured":"G. Chartrand and L. Lesniak, Graphs and Digraphs, Wadsworth and Brooks\/Cole, Pacific Grove, California, 1986."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"F. R. K. Chung and R. L. Graham, On graphs not containing prescribed induced subgraphs, A tribute to Paul Erd\u0151s, (eds. A. Baker, B. Bollob\u00e1s, and A.\u00a0Hajnal), Cambridge University Press, Cambridge, (1990), 111\u2013120.","DOI":"10.1017\/CBO9780511983917.009"},{"key":"8_CR23","unstructured":"P. Erd\u0151s, Problems and results in graph theory, The Theory and Applications of Graphs, G. Chartrand, editor, John Wiley (1981) 331\u2013341."},{"key":"8_CR24","unstructured":"P. Erd\u0151s, Some recent problems and results in graph theory, combinatorics, and number theory, Proceedings 7th S-E Conf. Comb. Graph Theory, and Computing, (1976) 3\u201314."},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s and R. J. Faudree, Size Ramsey numbers involving matchings, Colloquia Mathematica Societatis Janos Bolyai 37 (1981), 247\u2013264.","DOI":"10.1016\/B978-0-444-86893-0.50019-X"},{"key":"8_CR26","first-page":"29","volume":"71","author":"P. Erd\u0151s","year":"1990","unstructured":"P. Erd\u0151s, R. J. Faudree, R. J. Gould, A. Gy\u00e1rf\u00e1s, and R. H. Schelp, Monochromatic coverings in colored complete graphs, Congressus Numerantium 71 (1990), 29\u201338.","journal-title":"Congressus Numerantium"},{"key":"8_CR27","unstructured":"P. Erd\u0151s, R. J. Faudree, A. Gy\u00e1rf\u00e1s, and R. H. Schelp, Cycles in graphs without proper subgraphs of minimal degree 3, (Proceedings of the Eleventh British Combinatorial Conference), Ars Combin. 25B (1988), 195\u2013202."},{"key":"8_CR28","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1002\/jgt.3190130607","volume":"13","author":"P. Erd\u0151s","year":"1989","unstructured":"P. Erd\u0151s, R. J. Faudree, A. Gy\u00e1rf\u00e1s, and R. H. Schelp, Domination in colored complete graphs, J. Graph Theory 13 (1989), 713\u2013718.","journal-title":"J. Graph Theory"},{"key":"8_CR29","unstructured":"P. Erd\u0151s, R. J. Faudree, A. Gy\u00e1rf\u00e1s, and R. H. Schelp, Odd cycles in graphs of given minimal degree, Graph Theory, Combinatorics, and Applications, Wiley and Sons, New York, Proceedings of the Sixth International Conference on Graph Theory and Applications, (1991), 407\u2013418."},{"key":"8_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(88)90197-5","volume":"72","author":"P. Erd\u0151s","year":"1988","unstructured":"P. Erd\u0151s. R. J. Faudree, and E. Ordman, Clique partitions and clique coverings, Discrete Math. 72 (1988), 93\u2013101.","journal-title":"Discrete Math."},{"key":"8_CR31","unstructured":"P. Erd\u0151s, R. J. Faudree, T. J. Reid, R. H. Schelp, and W. Staton, Degree sequence and independence in K\n                4\n                -free graphs, to appear in Discrete Math."},{"key":"8_CR32","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(92)90586-5","volume":"101","author":"P. Erd\u0151s","year":"1992","unstructured":"P. Erd\u0151s, R. J. Faudree, and C. C. Rousseau, Extremal problems involving vertices and edges on odd cycles in graphs, Discrete Math. 101, (1992), 23\u201331.","journal-title":"Discrete Math."},{"key":"8_CR33","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/0095-8956(76)90016-2","volume":"20","author":"P. Erd\u0151s","year":"1976","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Generalized Ramsey theory for multiple colors, J. of Comb. Theory B 20 (1976), 250\u2013264.","journal-title":"J. of Comb. Theory B"},{"key":"8_CR34","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, Cycle-complete graph Ramsey numbers, J. of Graph Theory 2 (1978), 53\u201364.","journal-title":"J. of Graph Theory"},{"key":"8_CR35","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02018930","volume":"9","author":"P. Erd\u0151s","year":"1978","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, The Size Ramsey number, a new concept in generalized Ramsey theory, Periodica Mathematica Hungarica 9 (1978), 145\u2013161.","journal-title":"Periodica Mathematica Hungarica"},{"key":"8_CR36","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey numbers for brooms, Proc. 13th S.E. Conf. on Comb., Graph Theory and Computing 283\u2013294, (1982)."},{"key":"8_CR37","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Tree - multipartite graph Ramsey numbers, Graph Theory and Combinatorics - A Volume in Honor of Paul Erd\u0151s, Bela Bollob\u00e1s, editor, Academic Press, (1984), 155\u2013160."},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Multipartite graph\u00a0- sparse graph Ramsey numbers, Combinatorica 5, (1985), 311\u2013318. (with P.\u00a0Erd\u0151s, C. C. Rousseau, and R. H. Schelp.","DOI":"10.1007\/BF02579245"},{"key":"8_CR39","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0012-365X(87)90173-7","volume":"67","author":"P. Erd\u0151s","year":"1987","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, A Ramsey problem of Harary on graphs with prescribed size, Discrete Math. 67 (1987), 227\u2013234.","journal-title":"Discrete Math."},{"key":"8_CR40","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(88)90198-7","volume":"72","author":"P. Erd\u0151s","year":"1988","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Extremal theory and bipartite graph - tree Ramsey numbers, Discrete Math. 72 (1988), 103\u2013112.","journal-title":"Discrete Math."},{"key":"8_CR41","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Book - tree Ramsey numbers, Scientia, A: Mathematics 1 (1988), 111\u2013117."},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Multipartite graph\u00a0- tree Ramsey numbers, Annals of the New York Academy of Sciences, 576 (1989), 146\u2013154, Proceedings of the First China\u00a0- USA International Graph Theory Conf.","DOI":"10.1111\/j.1749-6632.1989.tb16393.x"},{"key":"8_CR43","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90162-B","volume":"85","author":"P. Erd\u0151s","year":"1990","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Subgraphs of minimal degree k, Discrete Math. 85, (1990), 53\u201358.","journal-title":"Discrete Math."},{"key":"8_CR44","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Ramsey size linear graphs, to appear in Proceedings of Cambridge Combinatorics Colloquium"},{"key":"8_CR45","unstructured":"P. Erd\u0151s, R. J. Faudree, C. C. Rousseau and R. H. Schelp, A local density condition for triangles, to appear in Discrete Math."},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s, R. J. Faudree, R. H. Schelp, and M. Simonvits An extremal result for paths, Annals of The New York Academy of Sceinces, 576 (1989), 155\u2013162. Proceedings of the China - USA Graph Theory Conf.","DOI":"10.1111\/j.1749-6632.1989.tb16394.x"},{"key":"8_CR47","unstructured":"P. Erd\u0151s, R. J. Faudree, and V. T. S\u00f3s, k-spectrum of a graph, to appear in Proceedings of the Seventh International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, Kalamazoo, Michigan"},{"key":"8_CR48","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0012-365X(93)90521-T","volume":"113","author":"P. Erd\u0151s","year":"1993","unstructured":"P. Erd\u0151s and C. C. Rousseau, The size Ramsey number of a complete bipartite graph, Discrete Math. 113, (1993), 259\u2013262.","journal-title":"Discrete Math."},{"key":"8_CR49","unstructured":"R. J. Faudree, Ramsey minimal graphs for forests, Ars Combin., 31, (1991), 117\u2013124."},{"key":"8_CR50","unstructured":"R. J. Faudree, R. J. Gould, M. S. Jacobson, J. Lehel, and L. M. Lesniak Graph spectra, manuscript."},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"J. H. Kim, The Ramsey numberR(3,\u2009t) has order of magnitudet\n                2\u2009\u2215\u2009logt, Random Structures and Algorithms 7 (1995), 17, 173\u2013207.","DOI":"10.1002\/rsa.3240070302"},{"key":"8_CR52","doi-asserted-by":"crossref","unstructured":"J. Nes\u0306etr\u0306il and V. R\u00f6dl, The structure of critical graphs, Acta. Math. Acad. Sci. Hungar., 32, (1978), 295\u2013300.","DOI":"10.1007\/BF01902367"},{"key":"8_CR53","doi-asserted-by":"crossref","unstructured":"V. Nikiforov, The cycle-complete graph Ramsey numbers, Combin. Prob. and Comp. 14, (2005), 349\u2013370.","DOI":"10.1017\/S096354830400642X"},{"key":"8_CR54","doi-asserted-by":"crossref","unstructured":"V. Nikiforov and C. C. Rousseau, Ramsey goodness and beyond, Combinatorica 29 (2009) 227\u2013262.","DOI":"10.1007\/s00493-009-2409-2"},{"key":"8_CR55","doi-asserted-by":"crossref","unstructured":"C. C. Rousseau and J. Sheehan, A class of Ramsey problems involving trees, J.\u00a0London Math. Soc. (2) 18, (1978), 392\u2013396.","DOI":"10.1112\/jlms\/s2-18.3.392"},{"key":"8_CR56","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(83)90273-X","volume":"46","author":"J. B. Shearer","year":"1983","unstructured":"J. B. Shearer, A note on the independence number of a triangle\u2013free graph, Discrete Math. 46, (1983), 83\u201387.","journal-title":"Discrete Math."},{"key":"8_CR57","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."}],"container-title":["The Mathematics of Paul Erd\u0151s II"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-7254-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T15:54:41Z","timestamp":1676649281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-7254-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781461472537","9781461472544"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-7254-4_8","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"18 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}