DOIAbstract
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the title. It is proved in a purely combinatorial way that for n sufficiently large log2T(r,n)n ⩽8.log2rr2 holds
AbstractLet T(r, n) denote the maximum number of subsets of an n-set satisfying the condition in the title. It is proved in a purely combinatorial way that for n sufficiently large log2T(r,n)n ⩽8.log2rr2 holds
AbstractWe determine the maximum size of a family of subsets in {1, 2,…, n} with the property that i...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F s...
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...
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-fr...
AbstractLet fk(n) denote the maximum of k-subsets of an n-set satisfying the condition in the title....
Let N ((w; r); T ) denote the minimum number of points in a (w; r)-cover-free family having T blocks...
AbstractDefine λ(n) to be the largest integer such that for each set A of size n and cover J of A, t...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
Let F[subscript 1] and F[subscript 2] be two families of subsets of an n-element set. We say that F[...
Let F be a family of subsets of an n-element set not containing four distinct members such that A∪B⊆...
Let F be a family of subsets of an n-element set not containing four distinct members such that A∪B⊆...
Let F be a family of subsets of an n-element set not containing four distinct members such that A∪B⊆...
Let F be a family of subsets of an n-element set not containing four distinct members such that A∪B⊆...
AbstractWe determine the maximum size of a family of subsets in {1, 2,…, n} with the property that i...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F s...
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...
AbstractA very short proof is presented for the almost best upper bound for the size of anr-cover-fr...
AbstractLet fk(n) denote the maximum of k-subsets of an n-set satisfying the condition in the title....
Let N ((w; r); T ) denote the minimum number of points in a (w; r)-cover-free family having T blocks...
AbstractDefine λ(n) to be the largest integer such that for each set A of size n and cover J of A, t...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
Let F[subscript 1] and F[subscript 2] be two families of subsets of an n-element set. We say that F[...
Let F be a family of subsets of an n-element set not containing four distinct members such that A∪B⊆...
Let F be a family of subsets of an n-element set not containing four distinct members such that A∪B⊆...
Let F be a family of subsets of an n-element set not containing four distinct members such that A∪B⊆...
Let F be a family of subsets of an n-element set not containing four distinct members such that A∪B⊆...
AbstractWe determine the maximum size of a family of subsets in {1, 2,…, n} with the property that i...
AbstractAn (r,w;d) cover-free family (CFF) is a family of subsets of a finite set X such that the in...
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F s...
Add to ORKG