AbstractA family F of subsets of a finite set X shatters a set D⊆X, if the intersections of the members of F with D coincide with the power set of D. The maximum size of a set shattered by F is the VC-dimension (or density) of the system. P. Frankl (1983, J. Combin. Theory Ser. A34, 41–45) investigates the behavior of the maximum size of a Sperner family having bounded VC-dimension and conjectures that if F⊆2[m] is a Sperner family of VC-dimension less than 0<d⩽m/2+1 then |F|⩽ [[formula]]. Recently this conjecture has been proved true for d=2, 3, 4 by R. P. Anstee and A. Sali (1997, Discrete Math.175, 13–21). We evaluate the maximum d(m) of the VC-dimension of Sperner families and give an upper bound on the maximum size of a family of dimen...
A set system \({\mathcal F}\) is \(t\)-intersecting, if the size of the intersection of every pair o...
AbstractA map δ from the first r natural numbers to the power set of a set Ω of cardinality n is cal...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
AbstractWe explore a problem of Frankl (1989). A family F of subsets of 0–1, 2, …, m is said to have...
As part of his seminal work, Sperner introduced Sperner set systems, which are a family of sets that...
Given a set X, a collection F ⊆ P(X) is said to be k-Sperner if it does not contain a chain of lengt...
Given a set X, a collection F ⊆ P(X) is said to be k-Sperner if it does not contain a chain of lengt...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets ...
A pair of families (F,G) is said to be cross-Sperner if there exists no pair of sets F ∈ F, G ∈ G wi...
We say that a set system F subset of 2([n]) shatters a given set S subset of [n] if 2(S) = {F boolea...
AbstractLet nc,d(r, k) denote the maximal cardinality of Sperner families F (i.e., X⫅̸Y for all X, Y...
AbstractLet |X| = n > 0, |Y| = k > 0, and Y ⊆ X. A family A of subsets of X is a Sperner family of X...
A set system \({\mathcal F}\) is \(t\)-intersecting, if the size of the intersection of every pair o...
AbstractA map δ from the first r natural numbers to the power set of a set Ω of cardinality n is cal...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
AbstractWe explore a problem of Frankl (1989). A family F of subsets of 0–1, 2, …, m is said to have...
As part of his seminal work, Sperner introduced Sperner set systems, which are a family of sets that...
Given a set X, a collection F ⊆ P(X) is said to be k-Sperner if it does not contain a chain of lengt...
Given a set X, a collection F ⊆ P(X) is said to be k-Sperner if it does not contain a chain of lengt...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets ...
A pair of families (F,G) is said to be cross-Sperner if there exists no pair of sets F ∈ F, G ∈ G wi...
We say that a set system F subset of 2([n]) shatters a given set S subset of [n] if 2(S) = {F boolea...
AbstractLet nc,d(r, k) denote the maximal cardinality of Sperner families F (i.e., X⫅̸Y for all X, Y...
AbstractLet |X| = n > 0, |Y| = k > 0, and Y ⊆ X. A family A of subsets of X is a Sperner family of X...
A set system \({\mathcal F}\) is \(t\)-intersecting, if the size of the intersection of every pair o...
AbstractA map δ from the first r natural numbers to the power set of a set Ω of cardinality n is cal...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...