An existence theorem for group divisible 3-designs of large order
From MaRDI portal
Publication:2431593
DOI10.1016/J.JCTA.2010.11.020zbMath1236.05051OpenAlexW4210656430MaRDI QIDQ2431593
Publication date: 15 April 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2010.11.020
Related Items (2)
A large order asymptotic existence theorem for group divisible 3-designs with index one ⋮ The Asymptotic Existence of Group Divisible ‐Designs of Large Order with Index One
Cites Work
- Unnamed Item
- Unnamed Item
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- A construction for orthogonal arrays with strength \(t\geq 3\)
- The existence theorem for group divisible designs of large order
- A construction for group divisible \(t\)-designs with strength \(t\geqslant 2\) and index unity
- A representation of large integers from combinatorial sieves
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Orthogonal Arrays of Index Unity
This page was built for publication: An existence theorem for group divisible 3-designs of large order