Integer and fractional packings in dense 3‐uniform hypergraphs
From MaRDI portal
Publication:4805219
DOI10.1002/rsa.10075zbMath1025.05045OpenAlexW2167858467MaRDI QIDQ4805219
Brendan Nagle, Vojtěch Rödl, Penny E. Haxell
Publication date: 11 May 2003
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10075
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Integer and fractional packings of hypergraphs ⋮ Constructive Packings of Triple Systems ⋮ Constructive Packings by Linear Hypergraphs ⋮ Note on the 3-graph counting Lemma ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Regularity properties for triple systems ⋮ Fractional decompositions of dense hypergraphs
Cites Work
- Unnamed Item
- Integer and fractional packings in dense graphs
- Near perfect coverings in graphs and hypergraphs
- Quick approximation to matrices and applications
- Constructive Quasi-Ramsey Numbers and Tournament Ranking
- Regularity properties for triple systems
- Extremal problems on set systems
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- [https://portal.mardi4nfdi.de/wiki/Publication:4870539 A linear programming perspective on the Frankl?R�dl?Pippenger theorem]
This page was built for publication: Integer and fractional packings in dense 3‐uniform hypergraphs
