DOIAbstract
AbstractIn this paper it is shown that if v ⩾ k + 1 then v ⩾ t − 1 + (k − t + 1)(k − t + 2)λ, where v, k, λ and t are the characteristic parameters of a t − (v, k, λ) design. We compare this bound with the known lower bounds on v
AbstractIn this paper it is shown that if v ⩾ k + 1 then v ⩾ t − 1 + (k − t + 1)(k − t + 2)λ, where v, k, λ and t are the characteristic parameters of a t − (v, k, λ) design. We compare this bound with the known lower bounds on v
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractThe aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to pro...
An LD(n, k, p, t; b) Lotto Design is a set of b k-sets (blocks) of an n-set such that any p-set inte...
AbstractIn this paper it is shown that if v ⩾ k + 1 then v ⩾ t − 1 + (k − t + 1)(k − t + 2)λ, where ...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
Let B be a family of k-subsets of a v-set V , with 1 less-than-or-equal-to k less-than-or-equal-to v...
AbstractFor positive integers t⩽k⩽v and λ we define a t-design, denoted Bi[k,λ;v], to be a pair (X,B...
We prove that if there exists a t - (v, k, λ) design satisfying the inequality (Formula Presented) f...
The aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to prove that ...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractThe aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to pro...
An LD(n, k, p, t; b) Lotto Design is a set of b k-sets (blocks) of an n-set such that any p-set inte...
AbstractIn this paper it is shown that if v ⩾ k + 1 then v ⩾ t − 1 + (k − t + 1)(k − t + 2)λ, where ...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
In this paper it is shown that if v k + 1 then v t - 1 + (k - t + 1)(k - t + 2)/¿, where v, k, ¿ and...
Let B be a family of k-subsets of a v-set V , with 1 less-than-or-equal-to k less-than-or-equal-to v...
AbstractFor positive integers t⩽k⩽v and λ we define a t-design, denoted Bi[k,λ;v], to be a pair (X,B...
We prove that if there exists a t - (v, k, λ) design satisfying the inequality (Formula Presented) f...
The aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to prove that ...
AbstractA λ-design is a system of subsets S1, S2,…, Sn from an n-set S, n > 3, where |Si ∩ Sj| = λ f...
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
It is shown that for v sufficiently large and $k\geqq 2t + 1$, for any feasible quadruple $t - ( v ,...
AbstractThe aim of this paper is to give a new combinatorial proof of Fisher’s inequality and to pro...
An LD(n, k, p, t; b) Lotto Design is a set of b k-sets (blocks) of an n-set such that any p-set inte...
Add to ORKG