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
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
If (Ai:1 ⩽ i ⩽ n) is a family of n finite sets, then two expressions for the number of SDRs for this...
compact set which is not the union of two H-sets. We make precise this result in two directions, pro...
AbstractWe give formulae for determining the number of ways of writing a finite set as the union of ...
AbstractGiven k finite sets S1,…,Sk, to what extent is it possible to partition their union into two...
AbstractWe enumerate the minimal covers of a finite set S, classifying such covers by their cardinal...
AbstractIn this paper a method of enumeration for n-balanced, labelled, minimum covers of a finite s...
AbstractA family of sets has the equal union property if and only if there exist two nonempty disjoi...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
AbstractAn explicit formula is derived for the number of k-element subsets A of {1,2,…n} such that n...
A collection {S1,S2,...} of nonempty sets is called a complementing system of subsets for a set X of...
AbstractLet C(v) denote the least number of quintuples of a v-set V with the property that every pai...
AbstractLet S be a finite set of order n. Let C(n, 4, 2) be the minimum number of quadruples such th...
In this thesis we deal with solving a combinatorics problem of finding the minimal covering of pairs...
In a lottery, n numbers are drawn from a set of m numbers. On a lottery ticket we fill out n numbers...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
If (Ai:1 ⩽ i ⩽ n) is a family of n finite sets, then two expressions for the number of SDRs for this...
compact set which is not the union of two H-sets. We make precise this result in two directions, pro...
AbstractWe give formulae for determining the number of ways of writing a finite set as the union of ...
AbstractGiven k finite sets S1,…,Sk, to what extent is it possible to partition their union into two...
AbstractWe enumerate the minimal covers of a finite set S, classifying such covers by their cardinal...
AbstractIn this paper a method of enumeration for n-balanced, labelled, minimum covers of a finite s...
AbstractA family of sets has the equal union property if and only if there exist two nonempty disjoi...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
AbstractAn explicit formula is derived for the number of k-element subsets A of {1,2,…n} such that n...
A collection {S1,S2,...} of nonempty sets is called a complementing system of subsets for a set X of...
AbstractLet C(v) denote the least number of quintuples of a v-set V with the property that every pai...
AbstractLet S be a finite set of order n. Let C(n, 4, 2) be the minimum number of quadruples such th...
In this thesis we deal with solving a combinatorics problem of finding the minimal covering of pairs...
In a lottery, n numbers are drawn from a set of m numbers. On a lottery ticket we fill out n numbers...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
If (Ai:1 ⩽ i ⩽ n) is a family of n finite sets, then two expressions for the number of SDRs for this...
compact set which is not the union of two H-sets. We make precise this result in two directions, pro...
DOI
Add to ORKG