Fractional decompositions of dense hypergraphs

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 482-493

  Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; GRAPHIC METHODS; INTEGRAL EQUATIONS; PROBABILITY;

FRACTIONAL DECOMPOSITIONS; HYPERGRAPHS; INTEGRAL PACKAING; PROBABILISTIC ARGUMENTS;

GRAPH THEORY;

EID: 26944441620     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_41     Document Type: Conference Paper

References (12)

1. R. Aharoni and P. Haxell, Hall's theorem for hypergraphs, Journal of Graph Theory 35 (2000), 83-88.
2. N. Alon and J. H. Spencer, The Probabilistic Method, Second Edition, Wiley, New York, 2000.
3. N. Alon and R. Yuster, On a hypergraph matching problem, submitted.
4. D. Dor and M. Tarsi, Graph decomposition is NPC - A complete proof of Holyer's conjecture, Proc. 20th ACM STOC, ACM Press (1992), 252-263.
5. P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, European J. Combinatorics 6 (1985), 317-326.
6. P. E. Haxell, B. Nagle and V. Rödl, Integer and fractional packings in dense 3-uniform hypergraphs, Random Structures and Algorithms 22 (2003), 248-310.
7. J. Kahn, Asymptotically good list colorings, J. Combin. Theory, Ser. A 73 (1996), 1-59.
8. V. Rödl, On a packing and covering problem, Europ. J. of Combin. 6 (1985), 69-78.
9. V. Rödl, M. Schacht, M. H. Siggers and N. Tokushige, Integer and fractional packings of hypergraphs, submitted.
10. R. M. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus Numerantium XV (1975), 647-659.
11. R. Yuster, Decomposing hypergraphs with simple hypertrees, Combinatorica 20 (2000), 119-140.
12. k-decompositions, J. Combin. Theory, Ser. B, to appear.