Fractional decompositions of dense hypergraphs
From MaRDI portal
Publication:3429620
DOI10.1112/blms/bdl013zbMath1121.05080OpenAlexW1983666266MaRDI QIDQ3429620
Publication date: 2 April 2007
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/bdl013
Hypergraphs (05C65) Combinatorial aspects of packing and covering (05B40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (4)
Fractional clique decompositions of dense graphs and hypergraphs ⋮ Rational decomposition of dense hypergraphs and some related eigenvalue estimates ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ A finite embedding theorem for partial Steiner 3-designs
Cites Work
- On a packing and covering problem
- Near perfect coverings in graphs and hypergraphs
- Decomposing hypergraphs into simple hypertrees
- Asymptotically good list-colorings
- On a hypergraph matching problem
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
- Hall's theorem for hypergraphs
- Integer and fractional packings in dense 3‐uniform hypergraphs
This page was built for publication: Fractional decompositions of dense hypergraphs
