Even though Peltesohn proved that a cyclic (v,3,1)-design exists if and only if $v\equiv 1,3\pmod{6}$ as early as 1939, the problem of determining the spectrum of cyclic (v,k,1)-designs with k>3 is far from being settled, even for k=4. This paper shows that a cyclic (v,4,1)-design exists if and only if $v\equiv 1,4\pmod{12}$ and $v\not\in\{16,25,28\}$
AbstractA CB(v,k,λ) means a cyclic 2-design of block size k coincidence number λ, and with v points....
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractIn this paper, the necessary and sufficient condition for the existence of a 1-rotational Sλ...
This is a program to check Theorem 4 and 5 of the paper ``The existence of cyclic (v,4,1)-designs''
This is a program for checking Theorem 4 and 5 of the paper ``The existence of cyclic (v,4,1)-design...
AbstractA cyclic 5-(13, 6, 4) design is constructed and is extended to a simple 6-(14, 7, 4) design ...
AbstractLet k and λ be positive integers and let v be a positive integer or an infinite cardinal num...
AbstractA cyclic 5-(13, 6, 4) design is constructed and is extended to a simple 6-(14, 7, 4) design ...
It is shown that 5-(24,12,6) and 4-(23,11,6) designs cannot exist and that consequently a non-trivia...
AbstractAlthough the existence of a Whist tournament design Wh(4n) for each n⩾1 was established in t...
We prove that the necessary conditions for the existence of cyclic block designs with block size 3 a...
Generalized whist tournament designs are resolvable or near-resolvable $(v,k,k-1)$-designs in which ...
AbstractIn this paper, the necessary and sufficient condition for the existence of a 1-rotational Sλ...
AbstractIn this paper we present a construction of 3-designs by using a 3-design with resolvability....
AbstractIn this paper interesting families of designs are constructed and studied. First, a family o...
AbstractA CB(v,k,λ) means a cyclic 2-design of block size k coincidence number λ, and with v points....
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractIn this paper, the necessary and sufficient condition for the existence of a 1-rotational Sλ...
This is a program to check Theorem 4 and 5 of the paper ``The existence of cyclic (v,4,1)-designs''
This is a program for checking Theorem 4 and 5 of the paper ``The existence of cyclic (v,4,1)-design...
AbstractA cyclic 5-(13, 6, 4) design is constructed and is extended to a simple 6-(14, 7, 4) design ...
AbstractLet k and λ be positive integers and let v be a positive integer or an infinite cardinal num...
AbstractA cyclic 5-(13, 6, 4) design is constructed and is extended to a simple 6-(14, 7, 4) design ...
It is shown that 5-(24,12,6) and 4-(23,11,6) designs cannot exist and that consequently a non-trivia...
AbstractAlthough the existence of a Whist tournament design Wh(4n) for each n⩾1 was established in t...
We prove that the necessary conditions for the existence of cyclic block designs with block size 3 a...
Generalized whist tournament designs are resolvable or near-resolvable $(v,k,k-1)$-designs in which ...
AbstractIn this paper, the necessary and sufficient condition for the existence of a 1-rotational Sλ...
AbstractIn this paper we present a construction of 3-designs by using a 3-design with resolvability....
AbstractIn this paper interesting families of designs are constructed and studied. First, a family o...
AbstractA CB(v,k,λ) means a cyclic 2-design of block size k coincidence number λ, and with v points....
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractIn this paper, the necessary and sufficient condition for the existence of a 1-rotational Sλ...