Integer and fractional packings of hypergraphs

Authors:
V. Rödl;M. Schacht;M. H. Siggers;N. Tokushige
Affiliations:
Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA;Humboldt Universität zu Berlin, Institut für Informatik, Unter den Linden 6, 10099 Berlin, Germany;Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA;College of Education, Ryukyu University, Nishihara, Okinawa 903-0213, Japan
Venue:
Journal of Combinatorial Theory Series B
Year:
2007

Citing 14
Cited 1

Asymptotic behavior of the chromatic index for hypergraphs

Journal of Combinatorial Theory Series A
The algorithmic aspects of the regularity lemma

Journal of Algorithms
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Nearly-perfect hypergraph packing is in NC

Information Processing Letters
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing
Constructive Quasi-Ramsey Numbers and Tournament Ranking

SIAM Journal on Discrete Mathematics
Hypergraphs, quasi-randomness, and conditions for regularity

Journal of Combinatorial Theory Series A
Extremal problems on set systems

Random Structures & Algorithms
Integer and fractional packings in dense 3-uniform hypergraphs

Random Structures & Algorithms
The regularity lemma and approximation schemes for dense problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Regularity lemma for k-uniform hypergraphs

Random Structures & Algorithms
Integer and fractional packing of families of graphs

Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
An Algorithmic Version of the Hypergraph Regularity Method

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Fractional decompositions of dense hypergraphs

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Research paper: Combinatorial and computational aspects of graph packing and graph decomposition

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let F"0 be a fixed k-uniform hypergraph. The problem of finding the integer F"0-packing number @n"F"""0(H) of a k-uniform hypergraph H is an NP-hard problem. Finding the fractional F"0-packing number @n"F"""0^*(H) however can be done in polynomial time. In this paper we give a lower bound for the integer F"0-packing number @n"F"""0(H) in terms of @n"F"""0^*(H) and show that @n"F"""0(H)=@n"F"""0^*(H)-o(|V(H)|^k).