Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-06T15:34:17.672Z Has data issue: false hasContentIssue false
  • English
  • Français

Hypergraph Packing and Graph Embedding

Published online by Cambridge University Press:  01 July 1999

V. RÖDL ,
A. RUCIŃSKI  and
A. TARAZ
V. RÖDL
Affiliation:
Emory University, Atlanta, GA, USA (e-mail: rodl@mathcs.emory.edu)
A. RUCIŃSKI
Affiliation:
A. Mickiewicz University, Poznań, Poland (e-mail: rucinski@math.amu.edu.pl)
A. TARAZ
Affiliation:
Humboldt University, Berlin, Germany (e-mail: taraz@informatik.hu-berlin.de)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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].

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 8 , Issue 4 , July 1999 , pp. 363 - 376
Copyright
1999 Cambridge University Press