Superpure digraph designs
From MaRDI portal
Publication:3150160
DOI10.1002/jcd.10013zbMath1008.05019MaRDI QIDQ3150160
Publication date: 29 September 2002
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.10013
05B05: Combinatorial aspects of block designs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
Super-simple, pan-orientable and pan-decomposable GDDs with block size 4, Super-simple balanced incomplete block designs with block size 4 and index 5, Super-simple (\(v\),\,5,\,2)-designs., Super-simple balanced incomplete block designs with block size 4 and index 9, Super-simple cyclic designs with small values, Super-simple \((\nu, 5, 5)\) designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the existence of 2-designs Slambda(2,3,v) without repeated blocks
- On indecomposable pure Mendelsohn triple systems
- Asymptotic results on suborthogonal \(\overrightarrow{\mathfrak G}\)-decompositions of complete digraphs
- Suborthogonal double covers of the complete graph by stars
- \(G\)-designs and related designs
- Orthogonal decomposition and packing of complete graphs
- Decompositions of edge-colored complete graphs
- Graph decompositions, handcuffed prisoners and balanced p-designs
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Directed triple systems
- On orthogonal double covers of kn and a conjecture of chung and west