Asymptotic Existence of Resolvable Graph Designs
From MaRDI portal
Recommendations
Cited in
(19)- Ramsey-nice families of graphs
- A family of resolvable regular graph designs
- Symmetric graph designs
- The Hamilton-Waterloo problem with even cycle lengths
- Constructions and uses of incomplete pairwise balanced designs
- Thickly-resolvable block designs
- The proportion of various graphs in graph-designs
- An existence theory for loopy graph decompositions
- scientific article; zbMATH DE number 3849246 (Why is no real title available?)
- scientific article; zbMATH DE number 5127213 (Why is no real title available?)
- Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
- The existence of \((K_2\times K_6)\)-designs
- A blow-up lemma for approximate decompositions
- The asymptotic existence of resolvable group divisible designs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Balancing permuted copies of multigraphs and integer matrices
- A survey on constructive methods for the Oberwolfach problem and its variants
- Resolvable group divisible designs with large groups
- The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs
This page was built for publication: Asymptotic Existence of Resolvable Graph Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3504921)