Hypergraph Packing and Graph Embedding
From MaRDI portal
Publication:4719435
DOI10.1017/S0963548399003879zbMath0938.05046WikidataQ105583892 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
05C65: Hypergraphs
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Regular pairs in sparse random graphs I, Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth, On 2-factors with \(k\) components, Distributing vertices along a Hamiltonian cycle in Dirac graphs, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Ramsey numbers for bipartite graphs with small bandwidth, Almost spanning subgraphs of random graphs after adversarial edge removal, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Hypergraph Packing and Sparse Bipartite Ramsey Numbers