Hypergraph Packing and Graph Embedding

DOI10.1017/S0963548399003879zbMath0938.05046OpenAlexW2091405760WikidataQ105583892 ScholiaQ105583892MaRDI QIDQ4719435

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

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

packinghypergraphs

Mathematics Subject Classification ID

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

Related Items (9)

Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Hypergraph Packing and Sparse Bipartite Ramsey Numbers ⋮ On 2-factors with \(k\) components ⋮ Regular pairs in sparse random graphs I ⋮ Distributing vertices along a Hamiltonian cycle in Dirac graphs ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ Almost spanning subgraphs of random graphs after adversarial edge removal ⋮ Ramsey numbers for bipartite graphs with small bandwidth

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