Publication date
January 1996
DOI Publisher
Academic Press. ISSN
0097-3165 Citation count (estimate)
107Abstract
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-free family overnelements
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-free family overnelements
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
AbstractCover-free families have been investigated by many researchers, and several variations of th...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
AbstractLet N((w, r), T) denote the minimum number of points in a (w, r)-cover-free family having T ...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-fr...
Let N ((w; r); T ) denote the minimum number of points in a (w; r)-cover-free family having T blocks...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
An old problem of Moser asks: what is the size of the largest union-free subfamily that one can guar...
AbstractLet X be an n-element set and F ⊂ (kx) such that all the (2 |F|) sets F1 ⌣ F2, F1, F2 ∈ F ar...
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
AbstractWe survey results concerning the maximum size of a family F of subsets of an n-element set s...
1 r-Union-free families of sets We generalize the definition of an r-union-free family F given in th...
AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets ...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
AbstractCover-free families have been investigated by many researchers, and several variations of th...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
AbstractLet N((w, r), T) denote the minimum number of points in a (w, r)-cover-free family having T ...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-fr...
Let N ((w; r); T ) denote the minimum number of points in a (w; r)-cover-free family having T blocks...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
An old problem of Moser asks: what is the size of the largest union-free subfamily that one can guar...
AbstractLet X be an n-element set and F ⊂ (kx) such that all the (2 |F|) sets F1 ⌣ F2, F1, F2 ∈ F ar...
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
AbstractWe survey results concerning the maximum size of a family F of subsets of an n-element set s...
1 r-Union-free families of sets We generalize the definition of an r-union-free family F given in th...
AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets ...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
AbstractCover-free families have been investigated by many researchers, and several variations of th...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
Add to ORKG