AbstractWe give formulae for determining the number of ways of writing a finite set as the union of a given number of subsets, in such a way that none of the subsets may be omitted. In particular, we consider the case in which the elements of the set are identical
AbstractA λ-cover of pairs by quintuples of a ν-set V is a family of 5-subsets of V (called blocks) ...
AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering n...
AbstractGiven k finite sets S1,…,Sk, to what extent is it possible to partition their union into two...
AbstractWe give formulae for determining the number of ways of writing a finite set as the union of ...
AbstractIn this paper a method of enumeration for n-balanced, labelled, minimum covers of a finite s...
AbstractWe enumerate the minimal covers of a finite set S, classifying such covers by their cardinal...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
In this thesis we deal with solving a combinatorics problem of finding the minimal covering of pairs...
AbstractIn the power set lattice of a finite set with n elements, a collection C of r element subset...
Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solut...
Let G be a finite Abelian group written additively which is the n-fold direct sum of ...
AbstractLet n ⩾ k ⩾ t be positive integers, and let Ω be a set of n elements. Let C(n, k, t) denote ...
AbstractA theorem in convex bodies (in fact, measure theory) and a theorem about translates of sets ...
AbstractBounds are obtained on the number of subsets in a family of subsets of an n element set whic...
Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. W...
AbstractA λ-cover of pairs by quintuples of a ν-set V is a family of 5-subsets of V (called blocks) ...
AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering n...
AbstractGiven k finite sets S1,…,Sk, to what extent is it possible to partition their union into two...
AbstractWe give formulae for determining the number of ways of writing a finite set as the union of ...
AbstractIn this paper a method of enumeration for n-balanced, labelled, minimum covers of a finite s...
AbstractWe enumerate the minimal covers of a finite set S, classifying such covers by their cardinal...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
In this thesis we deal with solving a combinatorics problem of finding the minimal covering of pairs...
AbstractIn the power set lattice of a finite set with n elements, a collection C of r element subset...
Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solut...
Let G be a finite Abelian group written additively which is the n-fold direct sum of ...
AbstractLet n ⩾ k ⩾ t be positive integers, and let Ω be a set of n elements. Let C(n, k, t) denote ...
AbstractA theorem in convex bodies (in fact, measure theory) and a theorem about translates of sets ...
AbstractBounds are obtained on the number of subsets in a family of subsets of an n element set whic...
Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. W...
AbstractA λ-cover of pairs by quintuples of a ν-set V is a family of 5-subsets of V (called blocks) ...
AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering n...
AbstractGiven k finite sets S1,…,Sk, to what extent is it possible to partition their union into two...
DOI
Add to ORKG