Fractional decompositions of dense hypergraphs
From MaRDI portal
Recommendations
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Integer and fractional packings in dense 3‐uniform hypergraphs
- scientific article; zbMATH DE number 15160
- Asymptotically optimal K_k-packings of dense graphs via fractional K_k-decompositions
- On a hypergraph matching problem
Cites work
- Asymptotically good list-colorings
- Asymptotically optimal K_k-packings of dense graphs via fractional K_k-decompositions
- Decomposing hypergraphs into simple hypertrees
- Hall's theorem for hypergraphs
- Integer and fractional packings in dense 3‐uniform hypergraphs
- Near perfect coverings in graphs and hypergraphs
- On a hypergraph matching problem
- On a packing and covering problem
Cited in
(8)- Fractional triangle decompositions of dense 3-partite graphs
- A finite embedding theorem for partial Steiner 3-designs
- Fractional clique decompositions of dense graphs and hypergraphs
- Asymptotically optimal K_k-packings of dense graphs via fractional K_k-decompositions
- Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- Combinatorial and computational aspects of graph packing and graph decomposition
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Fractional clique decompositions of dense hypergraphs
This page was built for publication: Fractional decompositions of dense hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429620)
