AbstractA family of sets F⊆2X is defined to be l-trace k-Sperner if for any subset Y of X with size l the trace of F on Y (the restriction of F to Y) does not contain any chain of length k+1. In this paper we investigate the maximum size that an l-trace k-Sperner family (with underlying set [n]={1,2,…,n}) can have for various values of k, l and n
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
Abstract: A family F ⊆ 2[n] saturates the monotone decreasing property P if F satisfies P and one ca...
AbstractA family of sets F⊆2X is defined to be l-trace k-Sperner if for any subset Y of X with size ...
A family of sets F ⊆ 2X is defined to be l-trace k-Sperner if for any subset Y of X with size l the ...
AbstractWe explore a problem of Frankl (1989). A family F of subsets of 0–1, 2, …, m is said to have...
AbstractWe explore a problem of Frankl (1989). A family F of subsets of 0–1, 2, …, m is said to have...
AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets ...
AbstractA family F of subsets of an n-set S is said to have property X for a k-coloring of S if for ...
Given a set X , a collection F ⊆ P (X) is said to be k-Sperner if it does not contain a chain of len...
AbstractLet |X| = n > 0, |Y| = k > 0, and Y ⊆ X. A family A of subsets of X is a Sperner family of X...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
AbstractIn this paper we investigate common generalizations of more-part and L-Sperner families. We ...
AbstractFor a family T of subsets of an n-set X we define the trace of it on a subset Y of X by TT(Y...
AbstractIf P is a partially ordered set, a k-family of P is a subset which contains no chains of len...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
Abstract: A family F ⊆ 2[n] saturates the monotone decreasing property P if F satisfies P and one ca...
AbstractA family of sets F⊆2X is defined to be l-trace k-Sperner if for any subset Y of X with size ...
A family of sets F ⊆ 2X is defined to be l-trace k-Sperner if for any subset Y of X with size l the ...
AbstractWe explore a problem of Frankl (1989). A family F of subsets of 0–1, 2, …, m is said to have...
AbstractWe explore a problem of Frankl (1989). A family F of subsets of 0–1, 2, …, m is said to have...
AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets ...
AbstractA family F of subsets of an n-set S is said to have property X for a k-coloring of S if for ...
Given a set X , a collection F ⊆ P (X) is said to be k-Sperner if it does not contain a chain of len...
AbstractLet |X| = n > 0, |Y| = k > 0, and Y ⊆ X. A family A of subsets of X is a Sperner family of X...
A central result in extremal set theory is the celebrated theorem of Sperner from 1928, which gives ...
AbstractIn this paper we investigate common generalizations of more-part and L-Sperner families. We ...
AbstractFor a family T of subsets of an n-set X we define the trace of it on a subset Y of X by TT(Y...
AbstractIf P is a partially ordered set, a k-family of P is a subset which contains no chains of len...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size a...
Abstract: A family F ⊆ 2[n] saturates the monotone decreasing property P if F satisfies P and one ca...
DOI
Add to ORKG