{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:16:27Z","timestamp":1758824187127},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":6986,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0166-218x(94)90108-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"187-195","source":"Crossref","is-referenced-by-count":11,"title":["Inequalities for minimal covering sets in set systems of given rank"],"prefix":"10.1016","volume":"51","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90108-2_BIB1","series-title":"Infinite and Finite Sets, Proc. Colloq. Math. Soc. J\u00e1nos Bolyai, Keszthely, Hungary, 1973","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0166-218X(94)90108-2_BIB2","first-page":"135","article-title":"Neuer Beweis eines Tutteschen Satzes","volume":"8","author":"Gallai","year":"1963","journal-title":"Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"10.1016\/0166-218X(94)90108-2_BIB3","article-title":"Partition covers and blocking sets in hypergraphs","author":"Gy\u00e1r\u00e1s","year":"1977","journal-title":"MTA SZTAKI Tanulm\u00e1nyok 71\/1977"},{"key":"10.1016\/0166-218X(94)90108-2_BIB4","first-page":"209","article-title":"On the minimax theorems of combinatorics","volume":"26","author":"Lov\u00e1sz","year":"1975","journal-title":"Mat. Lapok"},{"key":"10.1016\/0166-218X(94)90108-2_BIB5","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0095-8956(85)90043-7","article-title":"Critical hypergraphs and intersecting set-pair systems","volume":"39","author":"Tuza","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(94)90108-2_BIB6","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0097-3165(89)90064-2","article-title":"Minimum number of elements representing a set system of given rank","volume":"52","author":"Tuza","year":"1989","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901082?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901082?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:51:32Z","timestamp":1555116692000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0166218X94901082"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90108-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}