AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets of an n-element set must exceed k if there are more than (nk) in the family and k≤12 n. A generalized dealing with sums of weights over a set is also proven
A theorem of Erdös says: If A is a family of subsets of a set S of n elements and no h + 1 different...
Let F be a family of subsets of an n-element set. Sperner’s theo-rem says that if there is no inclus...
AbstractConsidering families of subsets of a given set. The families of maximal size are determined ...
AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets ...
AbstractA set X of subsets of an n-element set S is called an anti-chain if no two elements of X are...
AbstractA family F of subsets of an n-set S is said to have property X for a k-coloring of S if for ...
AbstractLet F be a Sperner family of subsets of {1,…,m}. Bollobás showed that if A ∈ F ⇒ A = {1,…,m}...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
AbstractWe survey results concerning the maximum size of a family F of subsets of an n-element set s...
AbstractA family of sets F⊆2X is defined to be l-trace k-Sperner if for any subset Y of X with size ...
AbstractA map δ from the first r natural numbers to the power set of a set Ω of cardinality n is cal...
AbstractIn this paper we investigate common generalizations of more-part and L-Sperner families. We ...
AbstractLet |X| = n > 0, |Y| = k > 0, and Y ⊆ X. A family A of subsets of X is a Sperner family of X...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
AbstractDenote by m(n,s) the size of a smallest family F; of n-element sets with the property that i...
A theorem of Erdös says: If A is a family of subsets of a set S of n elements and no h + 1 different...
Let F be a family of subsets of an n-element set. Sperner’s theo-rem says that if there is no inclus...
AbstractConsidering families of subsets of a given set. The families of maximal size are determined ...
AbstractIn this paper, we show that the average size of the elements of a Sperner family of subsets ...
AbstractA set X of subsets of an n-element set S is called an anti-chain if no two elements of X are...
AbstractA family F of subsets of an n-set S is said to have property X for a k-coloring of S if for ...
AbstractLet F be a Sperner family of subsets of {1,…,m}. Bollobás showed that if A ∈ F ⇒ A = {1,…,m}...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
AbstractWe survey results concerning the maximum size of a family F of subsets of an n-element set s...
AbstractA family of sets F⊆2X is defined to be l-trace k-Sperner if for any subset Y of X with size ...
AbstractA map δ from the first r natural numbers to the power set of a set Ω of cardinality n is cal...
AbstractIn this paper we investigate common generalizations of more-part and L-Sperner families. We ...
AbstractLet |X| = n > 0, |Y| = k > 0, and Y ⊆ X. A family A of subsets of X is a Sperner family of X...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
AbstractDenote by m(n,s) the size of a smallest family F; of n-element sets with the property that i...
A theorem of Erdös says: If A is a family of subsets of a set S of n elements and no h + 1 different...
Let F be a family of subsets of an n-element set. Sperner’s theo-rem says that if there is no inclus...
AbstractConsidering families of subsets of a given set. The families of maximal size are determined ...
DOI
Add to ORKG