{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:19Z","timestamp":1725566899702},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_41","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T04:13:22Z","timestamp":1285647202000},"page":"482-493","source":"Crossref","is-referenced-by-count":0,"title":["Fractional Decompositions of Dense Hypergraphs"],"prefix":"10.1007","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V","volume":"35","author":"R. Aharoni","year":"2000","unstructured":"Aharoni, R., Haxell, P.: Hall\u2019s theorem for hypergraphs. Journal of Graph Theory\u00a035, 83\u201388 (2000)","journal-title":"Journal of Graph Theory"},{"key":"41_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)","edition":"2"},{"key":"41_CR3","unstructured":"Alon, N., Yuster, R.: On a hypergraph matching problem (submitted)"},{"key":"41_CR4","first-page":"252","volume-title":"Proc. 20th ACM STOC","author":"D. Dor","year":"1992","unstructured":"Dor, D., Tarsi, M.: Graph decomposition is NPC - A complete proof of Holyer\u2019s conjecture. In: Proc. 20th ACM STOC, pp. 252\u2013263. ACM Press, New York (1992)"},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0195-6698(85)80045-7","volume":"6","author":"P. Frankl","year":"1985","unstructured":"Frankl, P., R\u00f6dl, V.: Near perfect coverings in graphs and hypergraphs. European J. Combinatorics\u00a06, 317\u2013326 (1985)","journal-title":"European J. Combinatorics"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1002\/rsa.10075","volume":"22","author":"P.E. Haxell","year":"2003","unstructured":"Haxell, P.E., Nagle, B., R\u00f6dl, V.: Integer and fractional packings in dense 3-uniform hypergraphs. Random Structures and Algorithms\u00a022, 248\u2013310 (2003)","journal-title":"Random Structures and Algorithms"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcta.1996.0001","volume":"73","author":"J. Kahn","year":"1996","unstructured":"Kahn, J.: Asymptotically good list colorings. J. Combin. Theory, Ser. A\u00a073, 1\u201359 (1996)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"41_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"6","author":"V. R\u00f6dl","year":"1985","unstructured":"R\u00f6dl, V.: On a packing and covering problem. Europ. J. of Combin.\u00a06, 69\u201378 (1985)","journal-title":"Europ. J. of Combin."},{"key":"41_CR9","unstructured":"R\u00f6dl, V., Schacht, M., Siggers, M.H., Tokushige, N.: Integer and fractional packings of hypergraphs (submitted)"},{"key":"41_CR10","unstructured":"Wilson, R.M.: Decomposition of complete graphs into subgraphs isomorphic to a given graph. Congressus Numerantium XV, 647\u2013659 (1975)"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s004930070036","volume":"20","author":"R. Yuster","year":"2000","unstructured":"Yuster, R.: Decomposing hypergraphs with simple hypertrees. Combinatorica\u00a020, 119\u2013140 (2000)","journal-title":"Combinatorica"},{"key":"41_CR12","unstructured":"Yuster, R.: Asymptotically optimal Kk-packings of dense graphs via fractional K\n                    k\n                  -decompositions. J. Combin. Theory, Ser. B (to appear)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:25Z","timestamp":1619506465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11538462_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}