AbstractCover-free families have been investigated by many researchers, and several variations of these set systems have been used in diverse applications. In this paper, we introduce a generalization of cover-free families which includes as special cases all of the previously used definitions. Then we give several bounds and some efficient constructions for these generalized cover-free families
Inspired by the “generalized t-designs ” defined by Cameron [P. J. Cameron, A generalisation of t-de...
A family of sets S = (S$ sb1$,S$ sb2$,...,S$ sb{m}$) is a k-fold cover for set T if each element of ...
Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and...
AbstractCover-free families have been investigated by many researchers, and several variations of th...
Let N ((w; r); T ) denote the minimum number of points in a (w; r)-cover-free family having T blocks...
Cover-free families (CFF) were considered from different subjects by numerous researchers. In this p...
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-fr...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
For an arbitrary graph G = (V, E), let X be a graphical property that can be possessed, or satisfied...
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-fr...
AbstractLet N((w, r), T) denote the minimum number of points in a (w, r)-cover-free family having T ...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
1 r-Union-free families of sets We generalize the definition of an r-union-free family F given in th...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
Inspired by the “generalized t-designs ” defined by Cameron [P. J. Cameron, A generalisation of t-de...
A family of sets S = (S$ sb1$,S$ sb2$,...,S$ sb{m}$) is a k-fold cover for set T if each element of ...
Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and...
AbstractCover-free families have been investigated by many researchers, and several variations of th...
Let N ((w; r); T ) denote the minimum number of points in a (w; r)-cover-free family having T blocks...
Cover-free families (CFF) were considered from different subjects by numerous researchers. In this p...
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-fr...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
For an arbitrary graph G = (V, E), let X be a graphical property that can be possessed, or satisfied...
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-fr...
AbstractLet N((w, r), T) denote the minimum number of points in a (w, r)-cover-free family having T ...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
1 r-Union-free families of sets We generalize the definition of an r-union-free family F given in th...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
Inspired by the “generalized t-designs ” defined by Cameron [P. J. Cameron, A generalisation of t-de...
A family of sets S = (S$ sb1$,S$ sb2$,...,S$ sb{m}$) is a k-fold cover for set T if each element of ...
Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and...
DOI
Add to ORKG