On saturated k-Sperner systems
Given a set X, a collection F ⊆ P(X) is said to be k-Sperner if it does not contain a chain of length k + 1 under set inclusion and it is saturated if it is maximal with respect to this property. Gerbner et al. [11] conjectured that, if |X| is sufficiently large with respect to k, then the minimum s...
Glavni autori: | Morrison, N, Noel, J, Scott, A |
---|---|
Format: | Journal article |
Izdano: |
Electronic Journal of Combinatorics
2014
|
Slični predmeti
-
On the Sperner property and Gorenstein Algebras Associated to Matroids
od: Toshiaki Maeno, i dr.
Izdano: (2012-01-01) -
The Sperner property for 132‐avoiding intervals in the weak order
od: Gaetz, Christian, i dr.
Izdano: (2022) -
Quadratic LYM-type inequalities for intersecting Sperner families
od: Christian Bey
Izdano: (2005-01-01) -
On the Two-Dimensional Version of the Sperner Lemma and Brouwer’s Theorem
od: Barcz Eugeniusz
Izdano: (2022-09-01) -
SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES
od: Gábor Czédli
Izdano: (2024-07-01)