DOIAbstract
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
Matching families are one of the major ingredients in the construction of locally decodable codes (L...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
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...
Let N ((w; r); T ) denote the minimum number of points in a (w; r)-cover-free family having T blocks...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
AbstractCover-free families have been investigated by many researchers, and several variations of th...
Cover-free families (CFF) were considered from different subjects by numerous researchers. In this p...
AbstractLet N((w, r), T) denote the minimum number of points in a (w, r)-cover-free family having T ...
For a property Γ and a family of sets F, let f(F,Γ) be the size of the largest subfamily of F having...
An old problem of Moser asks: what is the size of the largest union-free subfamily that one can guar...
Let F[subscript 1] and F[subscript 2] be two families of subsets of an n-element set. We say that F[...
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
: Following Frankl and Furedi [1] we say a family, F , of subsets of an n-set is weakly union-free i...
Matching families are one of the major ingredients in the construction of locally decodable codes (L...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
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...
Let N ((w; r); T ) denote the minimum number of points in a (w; r)-cover-free family having T blocks...
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the...
AbstractCover-free families have been investigated by many researchers, and several variations of th...
Cover-free families (CFF) were considered from different subjects by numerous researchers. In this p...
AbstractLet N((w, r), T) denote the minimum number of points in a (w, r)-cover-free family having T ...
For a property Γ and a family of sets F, let f(F,Γ) be the size of the largest subfamily of F having...
An old problem of Moser asks: what is the size of the largest union-free subfamily that one can guar...
Let F[subscript 1] and F[subscript 2] be two families of subsets of an n-element set. We say that F[...
AbstractWe discuss the maximum size of uniform intersecting families with covering number at leastτ....
: Following Frankl and Furedi [1] we say a family, F , of subsets of an n-set is weakly union-free i...
Matching families are one of the major ingredients in the construction of locally decodable codes (L...
AbstractLetDbe a finite family ofk-subsets (called blocks) of av-setX(v). ThenDis a (v, k, t) coveri...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
Add to ORKG