The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs

DOI10.1007/s10623-015-0090-6zbMath1323.05020OpenAlexW805058889MaRDI QIDQ887440

Esther R. Lamken

Publication date: 26 October 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0090-6

zbMATH Keywords

balanced incomplete block designresolvableorthogonal resolutionsKirkman square

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Triple systems (05B07)

Related Items (1)

The asymptotic existence of frames with a pair of orthogonal frame resolutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Doubly resolvable designs from generalized Bhaskar Rao designs
• On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
• Transversal designs and doubly-resolvable designs
• The existence of Room squares
• Constructions for generalized balanced tournament designs
• The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
• The existence of doubly resolvable \((v,3,2)\)-BIBDs
• Decompositions of edge-colored complete graphs
• A few more Kirkman squares and doubly near resolvable BIBDs with block size 3
• 3-complementary frames and doubly near resolvable (v,3,2)-BIBDs
• An Existence Theory for Incomplete Designs
• Doubly Resolvable Nearly Kirkman Triple Systems
• Generalized Balanced Tournament Designs
• Asymptotic Existence of Resolvable Graph Designs
• Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
• The Asymptotic Existence of Resolvable Group Divisible Designs
• Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
• Optimal doubly constant weight codes

This page was built for publication: The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs