Packings in Dense Regular Graphs

DOI10.1017/S0963548304006406zbMath1064.05121OpenAlexW2094302598MaRDI QIDQ4680571

Deryk Osthus, Daniela Kühn

Publication date: 7 June 2005

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

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

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (4)

Hamilton cycles in dense vertex-transitive graphs ⋮ An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs ⋮ A hypergraph blow-up lemma ⋮ Triangle packings and 1-factors in oriented graphs

This page was built for publication: Packings in Dense Regular Graphs