{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T21:28:12Z","timestamp":1698355692522},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1971,7,1]],"date-time":"1971-07-01T00:00:00Z","timestamp":47174400000},"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":15357,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1971,7]]},"DOI":"10.1016\/0097-3165(71)90002-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"1-10","source":"Crossref","is-referenced-by-count":13,"title":["An upper bound for the ramsey number M(5, 4)"],"prefix":"10.1016","volume":"11","author":[{"given":"K","family":"Walker","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(71)90002-1_BIB1","first-page":"264","article-title":"On a Problem of Formal Logic","volume":"30","author":"Ramsey","year":"1930"},{"key":"10.1016\/0097-3165(71)90002-1_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4153\/CJM-1955-001-4","article-title":"Combinatorial Relations and Chromatic Graphs","volume":"7","author":"Greenwood","year":"1955","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(71)90002-1_BIB3","first-page":"204","article-title":"Ramsey egy gr\u00e1felmel\u00e9ti t\u00e9t\u00e9ter\u00f6l","volume":"15","author":"K\u00e9ry","year":"1964","journal-title":"Mat. Lapok"},{"key":"10.1016\/0097-3165(71)90002-1_BIB4","article-title":"Chromatic Graphs and Ramsey's Theorem","author":"Kalbfleisch","year":"1966"},{"key":"10.1016\/0097-3165(71)90002-1_BIB5","doi-asserted-by":"crossref","first-page":"520","DOI":"10.4153\/CJM-1968-054-x","article-title":"Graph-Colouring and Combinatorial Numbers","volume":"20","author":"Sobczyk","year":"1968","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(71)90002-1_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0021-9800(68)80038-9","article-title":"Some Graph Theoretic Results Associated with Ramsey's Theorem","volume":"4","author":"Graver","year":"1968","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(71)90002-1_BIB7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0021-9800(67)80112-1","article-title":"Upper Bounds for Some Ramsey Numbers","volume":"2","author":"Kalbfleisch","year":"1967","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(71)90002-1_BIB8","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/S0021-9800(68)80070-5","article-title":"Dichromatic Graphs and Ramsey Numbers","volume":"5","author":"Walker","year":"1968","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(71)90002-1_BIB9","first-page":"463","article-title":"A Combinatorial Problem in Geometry","volume":"2","author":"Erd\u00f6s","year":"1935","journal-title":"Compositio Math."},{"key":"10.1016\/0097-3165(71)90002-1_BIB10","doi-asserted-by":"crossref","first-page":"778","DOI":"10.2307\/2310464","article-title":"On Sets of Acquaintances and Strangers at Any Party","volume":"66","author":"Goodman","year":"1959","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0097-3165(71)90002-1_BIB11","first-page":"394","article-title":"Une Majoration des Nombres de Ramsey Binaires-bicolores","volume":"266","author":"Giraud","year":"1968","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. A"},{"key":"10.1016\/0097-3165(71)90002-1_BIB12","first-page":"5","article-title":"Nouvelles Majorations des Nombres de Ramsey Binaires-bicolores","volume":"268","author":"Giraud","year":"1969","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. A"},{"key":"10.1016\/0097-3165(71)90002-1_BIB13","unstructured":"K. Walker, Computed Upper Bounds for Ramsey Numbers."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316571900021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316571900021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T09:25:58Z","timestamp":1548753958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316571900021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1971,7]]}},"alternative-id":["0097316571900021"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(71)90002-1","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1971,7]]}}}