Design theory
On existence and number of orthogonal arrays
Journal of Combinatorial Theory Series A - The Herbert J. Ryser Memorial Issue, Part 1
A construction for orthogonal arrays with strength t≥3
Discrete Mathematics
Decompositions of edge-colored complete graphs
Journal of Combinatorial Theory Series A
An existence theorem for group divisible designs of large order
Journal of Combinatorial Theory Series A
Asymptotic existence theorems for frames and group divisible designs
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
This paper gives the answer to a question of R.M. Wilson regarding the existence of group divisible designs of large order. Let k and u be positive integers such that 2==m"0 satisfying the necessary arithmetic conditions1.m(u-1)=0mod(k-1), 2.m^2u(u-1)=0modk(k-1). This paper also presents a large-index asymptotic existence theorem for group divisible t-designs with a fixed number of groups, fixed group size and fixed block size.