{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:18Z","timestamp":1761620958628},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1007\/bf02579271","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T18:16:08Z","timestamp":1174587368000},"page":"155-162","source":"Crossref","is-referenced-by-count":93,"title":["Maximum degree and fractional matchings in uniform hypergraphs"],"prefix":"10.1007","volume":"1","author":[{"given":"Zolt\u00e1n","family":"F\u00fcredi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579271_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70816-1","volume":"4","author":"C. Berge","year":"1979","unstructured":"C. Berge, Packing problems and hypergraph theory: a survey,Annals of Discrete Math. 4. (1979), 3\u201337.","journal-title":"Annals of Discrete Math."},{"key":"BF02579271_CR2","doi-asserted-by":"crossref","unstructured":"C. Berge andM. Simonovits, The coloring number of the direct product of two hypergraphs, in [3], 21\u201333.","DOI":"10.1007\/BFb0066176"},{"key":"BF02579271_CR3","series-title":"Lecture Notes","volume-title":"Hypergraph Seminar","year":"1972","unstructured":"C. Berge andD. K. Ray-Chaudhuri eds.,Hypergraph Seminar 1972,Lecture Notes 411 (Springer-Verlag, Berlin, 1972)."},{"key":"BF02579271_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1093\/qmath\/28.1.81","volume":"28","author":"B. Bollob\u00e1s","year":"1977","unstructured":"B. Bollob\u00e1s, Disjoint triples in a 3-graph with given maximal degree,Quart, J. Math. Oxford, Sec. Ser. 28 (1977), 81\u201387.","journal-title":"Quart, J. Math. Oxford, Sec. Ser."},{"key":"BF02579271_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1017\/S0305004100052233","volume":"79","author":"B. Bollob\u00e1s","year":"1976","unstructured":"B. Bollob\u00e1s andS. E. Eldridge, Maximal matchings in graphs with given minimal and maximal degrees,Math. Proc. Cambridge Phil. Soc. 79 (1976), 221\u2013234.","journal-title":"Math. Proc. Cambridge Phil. Soc."},{"key":"BF02579271_CR6","unstructured":"P. Erd\u0151s,private communication."},{"key":"BF02579271_CR7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0097-3165(78)90003-1","volume":"24","author":"P. Frankl","year":"1978","unstructured":"P. Frankl, On intersecting families of finite sets,J. Combinatorial Th. (A) 24 (1978), 146\u2013161.","journal-title":"J. Combinatorial Th. (A)"},{"key":"BF02579271_CR8","unstructured":"P. Frankl andZ. F\u00fcredi, Disjointr-tuples in anr-graph with given maximal degree, submitted toQuart, J. Math. Oxford."},{"key":"BF02579271_CR9","unstructured":"Z. F\u00fcredi, Erd\u0151s\u2014Ko\u2014Rado type theorems with upper bounds on the maximal degree, in:Algebraic Methods in Graph Theory, (Proc. Conf. Szeged 1978, L. Lov\u00e1sz et al. eds.)Coll. Math. Soc. J. Bolyai 25, North-Holland 1981, to appear."},{"key":"BF02579271_CR10","unstructured":"A. Gy\u00e1rf\u00e1s,to appear."},{"key":"BF02579271_CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, Normal hypergraphs and the perfect graph conjecture,Discrete Math. 2 (1972), 253\u2013267.","journal-title":"Discrete Math."},{"key":"BF02579271_CR12","volume-title":"Combinatorial problems and exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz,Combinatorial problems and exercises, Akad\u00e9miai Kiad\u00f3, Budapest\u2014North-Holland, Amsterdam 1979."},{"key":"BF02579271_CR13","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, Minimax theorems for hypergraphs, in [3], 111\u2013126.","DOI":"10.1007\/BFb0066186"},{"key":"BF02579271_CR14","unstructured":"L. Lov\u00e1sz, Doctoral thesis, Szeged 1977."},{"key":"BF02579271_CR15","first-page":"209","volume":"26","author":"L. Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz, On minimax theorems of combinatorics (in Hungarian)Matematikai Lapok 26 (1975), 209\u2013264.","journal-title":"Matematikai Lapok"},{"key":"BF02579271_CR16","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, Graph theory and integer programming,Annals of Discrete Math.,2 (1978)","DOI":"10.1016\/S0167-5060(08)70822-7"},{"key":"BF02579271_CR17","unstructured":"J. Pach andL. Sur\u00e1nyi, Graphs of diameter 2 and linear programming, inAlgebraic Methods in Graph Theory, (Proc. Conf. Szeged 1978, L. Lov\u00e1sz et al. eds.)Coll. Math. Soc. J. Bolyai 25, North-Holland 1981, to appear."},{"key":"BF02579271_CR18","unstructured":"J. Pelik\u00e1n, Properties of balanced incomplete block designs, in:Combinatorial Theory and its Applications (P. Erd\u0151s, A. R\u00e9nyi and V. T. S\u00f3s, eds.)Coll. Math. Soc. J. Bolyai 4, North-Holland 1971), 869\u2013890."},{"key":"BF02579271_CR19","unstructured":"Zs. Tuza, Some special cases of Ryser\u2019s conjecture, to appear."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579271.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579271\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:00Z","timestamp":1558183500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF02579271"],"URL":"https:\/\/doi.org\/10.1007\/bf02579271","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}