AbstractWe determine the asymptotics of the largest family {Ci}i=1M of subsets of an n-set with the property that for some bipartitions Ci = Ai ∪ Bi of the Ci's none of the inclusions Ai ⊂ Cj, Bi ⊂ Cj occurs. Our construction implies a new lower bound on the size of qualitatively independent partition systems in the Rényi sense
AbstractThe paper is concerned with several related combinatorial problems one of which is that of e...
Independence number (IN) is associated with a collection of sets. It is the maximum size of a subcol...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
AbstractWe determine the asymptotics of the largest family {Ci}i=1M of subsets of an n-set with the ...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
Let F be a family of subsets of an n-element set. Sperner’s theo-rem says that if there is no inclus...
AbstractSperner's theorem about the largest family of incomparable subsets of an n-set is in fact a ...
AbstractThe subsets A,B of the n-element X are said to be s-strongly separating if the two sets divi...
AbstractSperner's theorem about the largest family of incomparable subsets of an n-set is in fact a ...
As part of his seminal work, Sperner introduced Sperner set systems, which are a family of sets that...
AbstractA family F of subsets of a finite set X shatters a set D⊆X, if the intersections of the memb...
AbstractThe paper is concerned with several related combinatorial problems one of which is that of e...
Independence number (IN) is associated with a collection of sets. It is the maximum size of a subcol...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
AbstractWe determine the asymptotics of the largest family {Ci}i=1M of subsets of an n-set with the ...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
We determine the asymptotics of the largest family of qualitatively 2-independent k-partitions of an...
Let F be a family of subsets of an n-element set. Sperner’s theo-rem says that if there is no inclus...
AbstractSperner's theorem about the largest family of incomparable subsets of an n-set is in fact a ...
AbstractThe subsets A,B of the n-element X are said to be s-strongly separating if the two sets divi...
AbstractSperner's theorem about the largest family of incomparable subsets of an n-set is in fact a ...
As part of his seminal work, Sperner introduced Sperner set systems, which are a family of sets that...
AbstractA family F of subsets of a finite set X shatters a set D⊆X, if the intersections of the memb...
AbstractThe paper is concerned with several related combinatorial problems one of which is that of e...
Independence number (IN) is associated with a collection of sets. It is the maximum size of a subcol...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
DOI
Add to ORKG