{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T17:06:33Z","timestamp":1774026393974,"version":"3.50.1"},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8617,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1983,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The <jats:italic>size Ramsey number \u0159<\/jats:italic>(<jats:italic>G<\/jats:italic>) of a graph <jats:italic>G<\/jats:italic> is the smallest integer \u0159 such that there is a graph <jats:italic>F<\/jats:italic> of \u0159 edges with the property that <jats:italic>any<\/jats:italic> two\u2010coloring of the edges of <jats:italic>F<\/jats:italic> yields a monochromatic copy of <jats:italic>G<\/jats:italic>. First we show that the size Ramsey number \u0159(<jats:italic>P<jats:sub>n<\/jats:sub><\/jats:italic>) of the path <jats:italic>P<jats:sub>n<\/jats:sub><\/jats:italic> of length <jats:italic>n<\/jats:italic> is <jats:italic>linear<\/jats:italic> in <jats:italic>n<\/jats:italic>, solving a problem of Erd\u00f6s. Second we present a general upper bound on size Ramsey numbers of trees.<\/jats:p>","DOI":"10.1002\/jgt.3190070115","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:56:01Z","timestamp":1180421761000},"page":"115-129","source":"Crossref","is-referenced-by-count":97,"title":["On size Ramsey number of paths, trees, and circuits. I"],"prefix":"10.1002","volume":"7","author":[{"given":"J\u00f3Zsef","family":"Beck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579174"},{"key":"e_1_2_1_4_2","article-title":"Size Ramsey numbers involving matchings","author":"Erd\u00f6s P.","year":"1981","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai, Combinatorics, Eger (Hungary)"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018930"},{"key":"e_1_2_1_6_2","volume-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s P.","year":"1974"},{"key":"e_1_2_1_7_2","volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz L.","year":"1979"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90068-6"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90044-9"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190070115","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190070115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T22:47:01Z","timestamp":1697755621000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190070115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["10.1002\/jgt.3190070115"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190070115","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}