{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:15:22Z","timestamp":1712301322989},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":13712,"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":[[1976,1]]},"DOI":"10.1016\/0097-3165(76)90074-1","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"12-19","source":"Crossref","is-referenced-by-count":8,"title":["Ramsey graphs and block designs"],"prefix":"10.1016","volume":"20","author":[{"given":"T.D","family":"Parsons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(76)90074-1_BIB1","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1017\/S144678870000776X","article-title":"On a combinatorial generalization of 27 lines associated with a cubic surface","volume":"10","author":"Ahrens","year":"1969","journal-title":"J. Australian Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB2","unstructured":"S. A. Burr, Generalized Ramsey theory for graphs\u2014a survey, to appear."},{"key":"10.1016\/0097-3165(76)90074-1_BIB3","first-page":"434","article-title":"Hypergraphs and Ramseyian theorems","volume":"27","author":"Chv\u00e1tal","year":"1971"},{"key":"10.1016\/0097-3165(76)90074-1_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.4153\/CMB-1970-032-5","article-title":"An application of Ramsey's Theorem","volume":"13","author":"Cockayne","year":"1970","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0097-3165(76)90074-1_BIB5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1090\/S0002-9904-1956-10036-0","article-title":"A partition calculus in set theory","volume":"62","author":"Erd\u00f6s","year":"1956","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB6","first-page":"215","article-title":"On a problem of graph theory","volume":"1","author":"Erd\u00f6s","year":"1966","journal-title":"Studia Math. Hangar."},{"key":"10.1016\/0097-3165(76)90074-1_BIB7","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(76)90074-1_BIB8","unstructured":"J. Galovich, S. Galovich and S. Schuster, An elementary proof of the Friendship Theorem, to appear."},{"key":"10.1016\/0097-3165(76)90074-1_BIB9","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":"1966","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(76)90074-1_BIB10","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(76)90074-1_BIB11","series-title":"Combinatorial Theory","author":"Hall","year":"1967"},{"key":"10.1016\/0097-3165(76)90074-1_BIB12","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"No. 6","key":"10.1016\/0097-3165(76)90074-1_BIB13","first-page":"A","article-title":"Bipartite Ramsey theory","volume":"20","author":"Lawrence","year":"1973","journal-title":"Notices A.M.S."},{"key":"10.1016\/0097-3165(76)90074-1_BIB14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/1385-7258(72)90063-7","article-title":"The Friendship Theorem","volume":"34","author":"Longyear","year":"1972","journal-title":"Indag. Math."},{"key":"10.1016\/0097-3165(76)90074-1_BIB15","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0021-9800(67)80072-3","article-title":"Cooperative classes of finite sets in one and more dimensions","volume":"3","author":"Motzkin","year":"1967","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(76)90074-1_BIB16","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/S0021-9800(67)80073-5","article-title":"Bounds assuring subsets in convex position","volume":"3","author":"Motzkin","year":"1967","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0097-3165(76)90074-1_BIB17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(73)90045-9","article-title":"The Ramsey numbers R(Pm, Kn)","volume":"6","author":"Parsons","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(76)90074-1_BIB18","unstructured":"T. D. Parsons, Path-star Ramsey numbers, to appear in J. Combinatorial Theory (B)."},{"key":"10.1016\/0097-3165(76)90074-1_BIB19","unstructured":"T. D. Parsons, Ramsey graphs and block designs, 1, to appear. (Lecture given at Math. Forschungsinstitut Oberwolfach on March 29, 1973)."},{"key":"10.1016\/0097-3165(76)90074-1_BIB20","unstructured":"T. D. Parsons, Graphs from projective planes, to appear."},{"key":"10.1016\/0097-3165(76)90074-1_BIB21","first-page":"264","article-title":"On a problem of formal logic","volume":"30","author":"Ramsey","year":"1930"},{"key":"10.1016\/0097-3165(76)90074-1_BIB22","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1090\/S0002-9904-1964-11250-7","article-title":"The smallest graph of girth 5 and valency 4","volume":"70","author":"Robertson","year":"1964","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB23","series-title":"Combinatorias","article-title":"A generalization of Ramsey's Theorem","author":"Rothschild","year":"1971"},{"key":"10.1016\/0097-3165(76)90074-1_BIB24","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440147","article-title":"Combinatorial Mathematics","author":"Ryser","year":"1963"},{"key":"10.1016\/0097-3165(76)90074-1_BIB25","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BF01117497","article-title":"(\u03bd, \u03ba, \u03bb)-graphs and polarities of (\u03bd, \u03ba, \u03bb)-designs","volume":"120","author":"Rudvalis","year":"1971","journal-title":"Math. Z."},{"key":"10.1016\/0097-3165(76)90074-1_BIB26","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0123023","article-title":"A variation of the Friendship Theorem","volume":"23","author":"Skala","year":"1972","journal-title":"S.I.A.M. J. Appl. Math."},{"key":"10.1016\/0097-3165(76)90074-1_BIB27","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1017\/S0004972700042209","article-title":"Certain graphs arising from Hadamard matrices","volume":"1","author":"Wallis","year":"1969","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB28","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1017\/S0004972700042350","article-title":"On the relationship between graphs and partially balanced incomplete block designs","volume":"1","author":"Wallis","year":"1969","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB29","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1017\/S1446788700006820","article-title":"A nonexistence theorem for (\u03bd, \u03ba, \u03bb)-graphs","volume":"XI","author":"Wallis","year":"1970","journal-title":"J. Australian Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB30_1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1017\/S0004972700046244","article-title":"Construction of strongly regular graphs using affine designs","volume":"5","author":"Wallis","year":"1971","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB30_2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1017\/S0004972700047468","article-title":"Construction of strongly regular graphs using affine designs","volume":"5","author":"Wallis","year":"1971","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB31","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1017\/S0004972700044592","article-title":"On a problem of K. A. Bush concerning Hadamard matrices","volume":"6","author":"Wallis","year":"1972","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0097-3165(76)90074-1_BIB32","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0021-9800(70)80039-4","article-title":"Some nonisomorphic graphs","volume":"8","author":"Wallis","year":"1970","journal-title":"J. Combinatorial Theory"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316576900741?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316576900741?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T21:16:17Z","timestamp":1585948577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316576900741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["0097316576900741"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(76)90074-1","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}