Hypergraph Packing and Graph Embedding

Authors:
V. Rödl;A. Ruciński;A. Taraz
Affiliations:
Emory University, Atlanta, GA, USA (e-mail: rodl@mathcs.emory.edu);A. Mickiewicz University, Poznań, Poland (e-mail: rucinski@math.amu.edu.pl);Humboldt University, Berlin, Germany (e-mail: taraz@informatik.hu-berlin.de)
Venue:
Combinatorics, Probability and Computing
Year:
1999

Citing 5
Cited 4

The algorithmic aspects of the regularity lemma

Journal of Algorithms
An algorithmic version of the blow-up lemma

Random Structures & Algorithms
The Blow-up Lemma

Combinatorics, Probability and Computing
Extremal Graph Theory

Extremal Graph Theory
On the Pósa-Seymour conjecture

Journal of Graph Theory

On the number of Hamiltonian cycles in Dirac graphs

Discrete Mathematics
Regular pairs in sparse random graphs I

Random Structures & Algorithms
Hypergraph packing and sparse bipartite ramsey numbers

Combinatorics, Probability and Computing
Universality of Random Graphs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide sufficient conditions for packing two hypergraphs. The emphasis is on the asymptotic case when one of the hypergraphs has a bounded degree and the other is dense. As an application, we give an alternative proof for the bipartite case of the recently developed Blow-up Lemma [12].