AbstractThe subsets A,B of the n-element X are said to be s-strongly separating if the two sets divide X into four sets of size at least s. The maximum number h(n,s) of pairwise s-strongly separating subsets was asymptotically determined by Frankl (Ars Combin. 1 (1976) 53) for fixed s and large n. A new proof is given. Also, estimates for h(n,cn) are found where c is a small constant
Let X be an n-element set, where n is even. We refute a conjecture of J. Gordon and Y. Teplitskaya, ...
Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser grap...
Given a finite n-element set X, a family of subsets F ⊂ 2^X is said to separate X if any two element...
AbstractThe subsets A,B of the n-element X are said to be s-strongly separating if the two sets divi...
AbstractA collection F of sets is k-independent if for any selections A, B of k1 and k2 of its membe...
AbstractWe determine the asymptotics of the largest family {Ci}i=1M of subsets of an n-set with the ...
AbstractError correcting codes are used to describe explicit collections Fk of subsets of {1,2,...;n...
AbstractThe paper is concerned with several related combinatorial problems one of which is that of e...
Some best possible inequalities are established for k-partition free families (cf. Definition 1) and...
Let F(n) denote the maximum number of distinct subsets of an n-element set such that there are no fo...
AbstractPeleg [3] proved that g(n) = max{2(n − 1), [n24]} is an upper bound for the number of sets i...
: Following Frankl and Furedi [1] we say a family, F , of subsets of an n-set is weakly union-free i...
AbstractBounds are obtained on the number of subsets in a family of subsets of an n element set whic...
AbstractSuppose we are given a family of sets C = {S(j), j∈J}, where S(j) = ∩ki=1 Hi(j), and suppose...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
Let X be an n-element set, where n is even. We refute a conjecture of J. Gordon and Y. Teplitskaya, ...
Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser grap...
Given a finite n-element set X, a family of subsets F ⊂ 2^X is said to separate X if any two element...
AbstractThe subsets A,B of the n-element X are said to be s-strongly separating if the two sets divi...
AbstractA collection F of sets is k-independent if for any selections A, B of k1 and k2 of its membe...
AbstractWe determine the asymptotics of the largest family {Ci}i=1M of subsets of an n-set with the ...
AbstractError correcting codes are used to describe explicit collections Fk of subsets of {1,2,...;n...
AbstractThe paper is concerned with several related combinatorial problems one of which is that of e...
Some best possible inequalities are established for k-partition free families (cf. Definition 1) and...
Let F(n) denote the maximum number of distinct subsets of an n-element set such that there are no fo...
AbstractPeleg [3] proved that g(n) = max{2(n − 1), [n24]} is an upper bound for the number of sets i...
: Following Frankl and Furedi [1] we say a family, F , of subsets of an n-set is weakly union-free i...
AbstractBounds are obtained on the number of subsets in a family of subsets of an n element set whic...
AbstractSuppose we are given a family of sets C = {S(j), j∈J}, where S(j) = ∩ki=1 Hi(j), and suppose...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
Let X be an n-element set, where n is even. We refute a conjecture of J. Gordon and Y. Teplitskaya, ...
Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser grap...
Given a finite n-element set X, a family of subsets F ⊂ 2^X is said to separate X if any two element...
DOI
Add to ORKG