{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:47:36Z","timestamp":1648676856281},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf01788079","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T07:37:00Z","timestamp":1119166620000},"page":"67-80","source":"Crossref","is-referenced-by-count":8,"title":["t-expansive andt-wise intersecting hypergraphs"],"prefix":"10.1007","volume":"2","author":[{"given":"Z.","family":"F\u00fcredi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01788079_CR1","unstructured":"Alon, N., F\u00fcredi, Z.: On the kernel of intersecting families."},{"key":"BF01788079_CR2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02109371","volume":"15","author":"C. Bang","year":"1984","unstructured":"Bang, C., Sharp, H., Winkler, P.: On coverings of a finite set: depth and subcovers. Period. Math. Hung.15, 51\u201360 (1984)","journal-title":"Period. Math. Hung."},{"key":"BF01788079_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1017\/S0004972700047067","volume":"5","author":"A. Brace","year":"1971","unstructured":"Brace, A., Daykin, D.E.: Cover theorems for finite sets I\u2013III. Bull. Aust. Math. Soc.5, 197\u2013202 (1971),6, 19\u201324 (1972),6, 417\u2013433 (1972)","journal-title":"Bull. Aust. Math. Soc."},{"key":"BF01788079_CR4","first-page":"386","volume":"84","author":"D.E. Daykin","year":"1977","unstructured":"Daykin, D.E.: Problem E 2654. Amer. Math. Mon.84, 386 (1977). Minimum subcover of a cover of a finite set (Problem E 2654). Amer. Math. Mon.85, 766 (1978)","journal-title":"Amer. Math. Mon."},{"key":"BF01788079_CR5","first-page":"128","volume":"29","author":"D.E. Daykin","year":"1982","unstructured":"Daykin, D.E., Frankl, P.: Sets of finite sets satisfying union conditions. Mathematica29, 128\u2013134 (1982)","journal-title":"Mathematica"},{"key":"BF01788079_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canad. J. Math.17, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"key":"BF01788079_CR7","first-page":"609","volume":"10","author":"P. Erd\u00f6s","year":"1975","unstructured":"Erd\u00f6s, P., Lov\u00e1sz, L.: Problems and results in 3-chromatic hypergraphs and some related questions. In: Infinite and Finite Sets. Colloq. Math. Soc. J\u00e1nos Bolyai10, 609\u2013627 (1975)","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"BF01788079_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Rado, R.: Intersection theorems for systems of sets. J. London Math. Soc.35, 85\u201390 (1960)","journal-title":"J. London Math. Soc."},{"key":"BF01788079_CR9","doi-asserted-by":"crossref","unstructured":"Frankl, P., F\u00fcredi, Z.: Finite projective spaces and intersecting hypergraphs. Combinatorica (to appear)","DOI":"10.1007\/BF02579260"},{"key":"BF01788079_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02579271","volume":"1","author":"Z. F\u00fcredi","year":"1981","unstructured":"F\u00fcredi, Z.: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica1, 155\u2013162 (1981)","journal-title":"Combinatorica"},{"key":"BF01788079_CR11","first-page":"135","volume":"8","author":"T. Gallai","year":"1963","unstructured":"Gallai, T.: Neuer Beweis eines Tutte'shen Satzes. MTA Math. Kut. Int. K\u00f6zl.8, 135\u2013139 (1963)","journal-title":"MTA Math. Kut. Int. K\u00f6zl."},{"key":"BF01788079_CR12","first-page":"205","volume":"16-A","author":"D. Hanson","year":"1983","unstructured":"Hanson, D., Toft, B.: On the maximum number of vertices inn-uniform cliques. Ars Comb.16-A, 205\u2013216 (1983)","journal-title":"Ars Comb."},{"key":"BF01788079_CR13","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. Budapest: Akad\u00e9miai Kiad\u00f3\/Amsterdam: North-Holland 1979"},{"key":"BF01788079_CR14","first-page":"209","volume":"26","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: Doctoral Thesis. Szeged 1977. Also see: On minimax theorems of combinatorics (in Hungarian). Mat. Lapok26, 209\u2013264 (1975)","journal-title":"Mat. Lapok"},{"key":"BF01788079_CR15","first-page":"111","volume-title":"Hypergraph Seminar 1972, Lecture Notes in Mathematics 411","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Minimax theorems for hypergraphs. In: Hypergraph Seminar 1972, Lecture Notes in Mathematics 411, pp 111\u2013126. Berlin-Heidelberg-New York: Springer-Verlag 1972"},{"key":"BF01788079_CR16","first-page":"127","volume-title":"Hypergraph Seminar 1972, Lecture Notes in Mathematics 411","author":"J.-C. Meyer","year":"1974","unstructured":"Meyer, J.-C.: Quelques probl\u00e9mes concernant les cliques des hypergraphsh-complets etq-partih-complets. In: Hypergraph Seminar 1972, Lecture Notes in Mathematics 411, pp 127\u2013139. Berlin-Heidelberg-New York: Springer-Verlag 1974"},{"key":"BF01788079_CR17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0095-8956(85)90043-7","volume":"39","author":"Z. Tuza","year":"1985","unstructured":"Tuza, Z.: Critical hypergraphs and intersecting set-pair systems. J. Comb. Theory (B)39, 134\u2013145 (1985)","journal-title":"J. Comb. Theory (B)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788079.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788079\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T09:12:22Z","timestamp":1557479542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF01788079"],"URL":"https:\/\/doi.org\/10.1007\/bf01788079","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}