{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:17:46Z","timestamp":1648937866056},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00311-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"269-275","source":"Crossref","is-referenced-by-count":2,"title":["Ramsey linear families and generalized subdivided graphs"],"prefix":"10.1016","volume":"170","author":[{"given":"Yusheng","family":"Li","sequence":"first","affiliation":[]},{"given":"Cecil C.","family":"Rousseau","sequence":"additional","affiliation":[]},{"given":"\u013dubom\u00edr","family":"\u0160olt\u00e9s","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00311-1_BIB1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/jgt.3190180406","article-title":"Subdivided graphs have linear Ramsey number","volume":"18","author":"Alon","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00311-1_BIB2","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1112\/jlms\/s2-24.3.405","article-title":"Ramsey numbers involving graphs with long suspended paths","volume":"24","author":"Burr","year":"1981","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0012-365X(96)00311-1_BIB3","series-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai 10","first-page":"215","article-title":"On the magnitude of generalized Ramsey numbers","volume":"vol. 1","author":"Burr","year":"1973"},{"key":"10.1016\/S0012-365X(96)00311-1_BIB4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/jgt.3190070106","article-title":"Generalization of a Ramsey-theoretic result of Chv\u00e1tal","volume":"7","author":"Burr","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00311-1_BIB5","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1006\/jctb.1993.1012","article-title":"Graphs with linear bounded Ramsey numbers","volume":"57","author":"Chen","year":"1993","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(96)00311-1_BIB6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/jgt.3190010118","article-title":"Tree-complete graph Ramsey numbers","volume":"1","author":"Chv\u00e1tal","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00311-1_BIB7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","article-title":"The Ramsey number of a graph with bounded maximum degree","volume":"34","author":"Chv\u00e1tal","year":"1983","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(96)00311-1_BIB8","series-title":"Graph Theory, Combinatorics, Algorithms, and Applications","first-page":"207","article-title":"On Ramsey numbers of K2,2","author":"Exoo","year":"1991"},{"key":"10.1016\/S0012-365X(96)00311-1_BIB9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(94)90158-9","article-title":"An upper bound for the Ramsey number r(K3,G)","volume":"125","author":"Goddard","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00311-1_BIB10","doi-asserted-by":"crossref","unstructured":"Y-S. Li and C.C. Rousseau, Fan-complete graph Ramsey numbers, J. Graph Theory, to appear.","DOI":"10.1002\/(SICI)1097-0118(199612)23:4<413::AID-JGT10>3.3.CO;2-D"},{"key":"10.1016\/S0012-365X(96)00311-1_BIB11","unstructured":"V. R\u00f6dl and R. Thomas, Arrangeability and clique subdivisions, Preprint."},{"key":"10.1016\/S0012-365X(96)00311-1_BIB12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/jctb.1993.1036","article-title":"The Ramsey number of an N-edge graph versus a triangle is at most 2N+1","volume":"58","author":"Sidorenko","year":"1993","journal-title":"J. Combin. Theory B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003111?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003111?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:26:53Z","timestamp":1553196413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96003111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96003111"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00311-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}