{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:18:03Z","timestamp":1648761483840},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0095-8956(91)90087-z","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:32:55Z","timestamp":1094653975000},"page":"30-41","source":"Crossref","is-referenced-by-count":0,"title":["Infinite friendship graphs with infinite parameters"],"prefix":"10.1016","volume":"52","author":[{"given":"Ge\u0148a","family":"Hahn","sequence":"first","affiliation":[]},{"given":"Eric C","family":"Milner","sequence":"additional","affiliation":[]},{"given":"Robert E","family":"Woodrow","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(91)90087-Z_BIB1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0003-4843(76)90018-8","article-title":"Almost disjoint sets, the dense set problem and the partition calculus","volume":"10","author":"Baumgartner","year":"1976","journal-title":"Ann., Math. Logic"},{"key":"10.1016\/0095-8956(91)90087-Z_BIB2","first-page":"351","article-title":"Kotzitg's conjecture on generalized friendship graphs","volume":"27","author":"Bondy","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(91)90087-Z_BIB3","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/0095-8956(77)90076-4","article-title":"Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices","volume":"22","author":"Carstens","year":"1970","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90087-Z_BIB4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.4153\/CMB-1976-064-1","article-title":"There are 2N\u03b1 friendship graphs of cardinal N\u03b1","volume":"19","author":"Chv\u00e1tal","year":"1976","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0095-8956(91)90087-Z_BIB5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0012-365X(84)90162-6","article-title":"Infinite generalized friendship graphs","volume":"49","author":"Delorme","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(91)90087-Z_BIB6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","article-title":"On chromatic number of graphs and set-systems","volume":"17","author":"Erd\u00f6s","year":"1966","journal-title":"Acta Math. Hungar."},{"key":"10.1016\/0095-8956(91)90087-Z_BIB7","first-page":"215","article-title":"On a problem of graph, theory","volume":"1","author":"Erd\u00f6s","year":"1966","journal-title":"Studia Sci. Hungar."},{"key":"10.1016\/0095-8956(91)90087-Z_BIB8_1","first-page":"25","article-title":"Graphes d'amiti\u00e9 et plans en blocs symm\u00e9triques","volume":"51","author":"Le Conte de Poly","year":"1975","journal-title":"Math. Sci. Humaines"},{"key":"10.1016\/0095-8956(91)90087-Z_BIB8_2","first-page":"87","article-title":"Graphes d'amiti\u00e9 et plans en blocs symm\u00e9triques","volume":"51","author":"Le Conte de Poly","year":"1975","journal-title":"Math. Sci. Humaines"},{"key":"10.1016\/0095-8956(91)90087-Z_BIB9","volume":"Vol. 132","author":"Mulder","year":"1980"},{"key":"10.1016\/0095-8956(91)90087-Z_BIB10","first-page":"57","article-title":"A generalization of the friendship theorem","volume":"28","author":"Suldolsk\u00fd","year":"1978","journal-title":"Math. Slovaca"},{"key":"10.1016\/0095-8956(91)90087-Z_BIB11_1","doi-asserted-by":"crossref","first-page":"188","DOI":"10.4064\/fm-12-1-188-205","article-title":"Sur la d\u00e9composition des ensembles en sous-ensembles presque disjoints","volume":"12","author":"Tarski","year":"1928","journal-title":"Fund. Math."},{"key":"10.1016\/0095-8956(91)90087-Z_BIB11_2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.4064\/fm-14-1-205-215","article-title":"Sur la d\u00e9composition des ensembles en sous-ensembles presque disjoints","volume":"14","author":"Tarski","year":"1929","journal-title":"Fund. Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569190087Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569190087Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T03:20:14Z","timestamp":1549250414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569190087Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["009589569190087Z"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(91)90087-z","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}