Hypergraph Packing and Graph Embedding

DOI10.1017/S0963548399003879MaRDI QIDQ4719435zbMATH OpenOpenAlexWikidataFDO

Authors Vojtěch Rödl, Andrzej Ruciński, Anusch Taraz

Publication date 4 January 2000

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548399003879

zbMATH Keywords

hypergraphspacking

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A hypergraph blow-up lemma
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• Packing random graphs and hypergraphs
• The Blow-up Lemma
• On perfect packings in dense graphs

Cited in

(15)

• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
• Ramsey numbers for bipartite graphs with small bandwidth
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• A hypergraph blow-up lemma
• Embedding graphs having Ore-degree at most five
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Hypergraph packing and sparse bipartite Ramsey numbers
• Embedding large subgraphs into dense graphs
• Regular pairs in sparse random graphs I
• Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
• High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix
• Packing random graphs and hypergraphs
• On packing of two copies of a hypergraph
• On 2-factors with \(k\) components
• Distributing vertices along a Hamiltonian cycle in Dirac graphs

This page was built for publication: Hypergraph Packing and Graph Embedding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719435)