Asymptotic Existence of Resolvable Graph Designs
From MaRDI portal
Publication:3504921
DOI10.4153/CMB-2007-050-xzbMath1152.05015OpenAlexW2043757383MaRDI QIDQ3504921
Alan C. H. Ling, Peter J. Dukes
Publication date: 18 June 2008
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-2007-050-x
Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items (10)
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Ramsey-nice families of graphs ⋮ The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs ⋮ Balancing permuted copies of multigraphs and integer matrices ⋮ A blow-up lemma for approximate decompositions ⋮ The Asymptotic Existence of Resolvable Group Divisible Designs ⋮ Resolvable group divisible designs with large groups ⋮ An existence theory for loopy graph decompositions ⋮ The Hamilton-Waterloo problem with even cycle lengths ⋮ Constructions and uses of incomplete pairwise balanced designs
This page was built for publication: Asymptotic Existence of Resolvable Graph Designs
