{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:06:32Z","timestamp":1648695992845},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":7929,"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":[[1991,11]]},"DOI":"10.1016\/0012-365x(91)90027-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"221-228","source":"Crossref","is-referenced-by-count":0,"title":["An isoperimetric lemma"],"prefix":"10.1016","volume":"94","author":[{"given":"A.","family":"Bialostocki","sequence":"first","affiliation":[]},{"given":"P.","family":"Dierker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90027-Y_BIB1","first-page":"103","article-title":"Remark on a paper of Gerencs\u00e9r and Gy\u00e1rf\u00e1s","volume":"13","author":"Andr\u00e1sfai","year":"1970","journal-title":"Ann. Univ. Sci. Budapest Eőtvős Sect. Math."},{"key":"10.1016\/0012-365X(91)90027-Y_BIB2","unstructured":"A. Bialostocki and P. Dierker, Monochromatic connected subgraphs in a multicoloring of the complete graph, manuscript."},{"key":"10.1016\/0012-365X(91)90027-Y_BIB3","first-page":"123","article-title":"On (n, k) colorings of complete graphs","volume":"58","author":"Bierbrauer","year":"1987","journal-title":"Cong. Numer."},{"key":"10.1016\/0012-365X(91)90027-Y_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02579271","article-title":"Maximum degree and fractional matchings in uniform hypergraphs","volume":"1","author":"F\u00fcredi","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(91)90027-Y_BIB5","first-page":"167","article-title":"On Ramsey-type problems","volume":"10","author":"Gerencs\u00e9r","year":"1967","journal-title":"Ann. Univ. Sci. Budapest Eőtovős Sect. Math"},{"key":"10.1016\/0012-365X(91)90027-Y_BIB6","article-title":"Partition covers and blocking sets in hypergraphs (in Hungarian)","volume":"71","author":"Gy\u00e1rf\u00e1s","year":"1977","journal-title":"MTA SZTAKI studies"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190027Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190027Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:49Z","timestamp":1555136569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190027Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0012365X9190027Y"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90027-y","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}