AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering numbers. Three infinite families of minimal (t + 1)-coverings obtained from t-designs are described
AbstractA theorem on combining t-designs with k = t + 1 is presented. Utilizing the theorem, we prod...
AbstractIn this article we look at pair covering designs with a block size of 5 and v≡0(mod4). The n...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering n...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
AbstractLet S′ be a simple S′λ(t, k, l) containing b′blocks and let S be a, not necessarily simple, ...
AbstractA λ-cover of pairs by quintuples of a ν-set V is a family of 5-subsets of V (called blocks) ...
AbstractA (v,k,t)covering design, orcovering, is a family ofk-subsets, calledblocks, chosen from av-...
AbstractNew upper bounds for C(v,k,t), the minimum number of k-subsets (blocks) out of a v-set such ...
AbstractA t-(ν, k, λ) design is a pair (X, B), where B is a collection of k-subsets (called blocks) ...
AbstractLet n ⩾ k ⩾ t be positive integers, and let Ω be a set of n elements. Let C(n, k, t) denote ...
AbstractA defining set of a t-(v,k,λ) design is a subcollection of its blocks which is contained in ...
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called bl...
AbstractLet X be a finite set of size ν, let λ be a positive integer, and α(4, λ, ν) be the minimum ...
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subse...
AbstractA theorem on combining t-designs with k = t + 1 is presented. Utilizing the theorem, we prod...
AbstractIn this article we look at pair covering designs with a block size of 5 and v≡0(mod4). The n...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering n...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
AbstractLet S′ be a simple S′λ(t, k, l) containing b′blocks and let S be a, not necessarily simple, ...
AbstractA λ-cover of pairs by quintuples of a ν-set V is a family of 5-subsets of V (called blocks) ...
AbstractA (v,k,t)covering design, orcovering, is a family ofk-subsets, calledblocks, chosen from av-...
AbstractNew upper bounds for C(v,k,t), the minimum number of k-subsets (blocks) out of a v-set such ...
AbstractA t-(ν, k, λ) design is a pair (X, B), where B is a collection of k-subsets (called blocks) ...
AbstractLet n ⩾ k ⩾ t be positive integers, and let Ω be a set of n elements. Let C(n, k, t) denote ...
AbstractA defining set of a t-(v,k,λ) design is a subcollection of its blocks which is contained in ...
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called bl...
AbstractLet X be a finite set of size ν, let λ be a positive integer, and α(4, λ, ν) be the minimum ...
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subse...
AbstractA theorem on combining t-designs with k = t + 1 is presented. Utilizing the theorem, we prod...
AbstractIn this article we look at pair covering designs with a block size of 5 and v≡0(mod4). The n...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
DOI
Add to ORKG