{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:07:38Z","timestamp":1787317658161,"version":"build-2736575974"},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":6468,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0195-6698(95)90047-0","type":"journal-article","created":{"date-parts":[[2004,8,5]],"date-time":"2004-08-05T00:27:27Z","timestamp":1091665647000},"page":"655-658","source":"Crossref","is-referenced-by-count":3,"title":["On two set-systems with restricted cross-intersections"],"prefix":"10.1016","volume":"16","author":[{"given":"Chuanzhong","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0195-6698(95)90047-0_BIB1","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01904851","article-title":"On generalized graphs","volume":"16","author":"Bollob\u00e1s","year":"1965","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/0195-6698(95)90047-0_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","article-title":"An extremal problem for two families of sets","volume":"3","author":"Frankl","year":"1982","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90047-0_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0195-6698(84)80026-8","article-title":"Geometrical solution of an intersection problem for two hypergraphs","volume":"5","author":"F\u00fcredi","year":"1984","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90047-0_BIB4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF01864160","article-title":"Matching and covers in hypergraphs","volume":"4","author":"F\u00fcredi","year":"1988","journal-title":"Graphs Combin."},{"key":"10.1016\/0195-6698(95)90047-0_BIB5","series-title":"Combinatorial Surveys (Proc. 6th British Combin. Conf.)","first-page":"45","article-title":"Flats in matroids and geometric graphs","author":"Lov\u00e1sz","year":"1977"},{"key":"10.1016\/0195-6698(95)90047-0_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","article-title":"On a packing and covering problems","volume":"6","author":"R\u00f6dl","year":"1985","journal-title":"Europ. J. Combin."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900470?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900470?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:34:16Z","timestamp":1549326856000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0195669895900470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["0195669895900470"],"URL":"https:\/\/doi.org\/10.1016\/0195-6698(95)90047-0","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}