Integer and fractional packings of hypergraphs

DOI10.1016/j.jctb.2006.05.006zbMath1111.05082OpenAlexW1977123275MaRDI QIDQ864903

Vojtěch Rödl, Norihide Tokushige, Mark H. Siggers, Mathias Schacht

Publication date: 13 February 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.05.006

zbMATH Keywords

hypergraph regularity lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Fractional clique decompositions of dense graphs and hypergraphs ⋮ Fractional cycle decompositions in hypergraphs ⋮ Constructive Packings of Triple Systems ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Constructive Packings by Linear Hypergraphs ⋮ The counting lemma for regular k‐uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Nearly-perfect hypergraph packing is in NC
• Asymptotic behavior of the chromatic index for hypergraphs
• Integer and fractional packings in dense graphs
• Near perfect coverings in graphs and hypergraphs
• Quick approximation to matrices and applications
• Lower bounds of tower type for Szemerédi's uniformity lemma
• Hypergraphs, quasi-randomness, and conditions for regularity
• An Algorithmic Version of the Hypergraph Regularity Method
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• The Algorithmic Aspects of the Regularity Lemma
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Extremal problems on set systems
• Integer and fractional packing of families of graphs
• Integer and fractional packings in dense 3‐uniform hypergraphs
• Regularity Lemma for k-uniform hypergraphs
• Regular Partitions of Hypergraphs: Counting Lemmas
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Integer and fractional packings of hypergraphs