Hostname: page-component-5b777bbd6c-gcwzt Total loading time: 0 Render date: 2025-06-16T16:56:31.399Z 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)
Get access Rights & Permissions [Opens in a new window]

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

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable