DOIAbstract
AbstractWe enumerate the minimal covers of a finite set S, classifying such covers by their cardinality, and also by the number of elements in S which they cover uniquely
AbstractWe enumerate the minimal covers of a finite set S, classifying such covers by their cardinality, and also by the number of elements in S which they cover uniquely
AbstractLet T be a finite topology. If P and Q are open sets of T (Q may be the null set) then P is ...
International audienceWe develop three approaches of combinatorial flavour to study the structure of...
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subse...
AbstractIn this paper a method of enumeration for n-balanced, labelled, minimum covers of a finite s...
In this thesis we deal with solving a combinatorics problem of finding the minimal covering of pairs...
AbstractWe give formulae for determining the number of ways of writing a finite set as the union of ...
A cover of a finite noncyclic group G is a family \u210b of proper subgroups of G whose union equals...
AbstractLet V be a finite non-empty set of n elements, let r be a natural integer and let A = {A1, …...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
AbstractIn the power set lattice of a finite set with n elements, a collection C of r element subset...
AbstractMinimal covering of infinite sets is studied. It is shown that if M⊂2X is closed, then M con...
AbstractA set T is a covering set of a set system F if T∩F≠∅ for all F ϵ F. We present inequalities ...
There is a π20 enumeration degree which is a strong minimal cover. This is the best result possible ...
A finite cover $\mathcal{C}$ of a group $G$ is a finite collection of proper subgroups of $G$ such t...
The work covers the minimal calculated enumerations in the families of the recursive-enumerated sets...
AbstractLet T be a finite topology. If P and Q are open sets of T (Q may be the null set) then P is ...
International audienceWe develop three approaches of combinatorial flavour to study the structure of...
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subse...
AbstractIn this paper a method of enumeration for n-balanced, labelled, minimum covers of a finite s...
In this thesis we deal with solving a combinatorics problem of finding the minimal covering of pairs...
AbstractWe give formulae for determining the number of ways of writing a finite set as the union of ...
A cover of a finite noncyclic group G is a family \u210b of proper subgroups of G whose union equals...
AbstractLet V be a finite non-empty set of n elements, let r be a natural integer and let A = {A1, …...
AbstractLet V be a finite set of ν elements. A covering of the pairs of V by k-subsets is a family F...
AbstractIn the power set lattice of a finite set with n elements, a collection C of r element subset...
AbstractMinimal covering of infinite sets is studied. It is shown that if M⊂2X is closed, then M con...
AbstractA set T is a covering set of a set system F if T∩F≠∅ for all F ϵ F. We present inequalities ...
There is a π20 enumeration degree which is a strong minimal cover. This is the best result possible ...
A finite cover $\mathcal{C}$ of a group $G$ is a finite collection of proper subgroups of $G$ such t...
The work covers the minimal calculated enumerations in the families of the recursive-enumerated sets...
AbstractLet T be a finite topology. If P and Q are open sets of T (Q may be the null set) then P is ...
International audienceWe develop three approaches of combinatorial flavour to study the structure of...
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subse...
Add to ORKG