Journal article
On saturated k-Sperner systems
- Abstract:
-
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 size of a saturated k-Sperner system F ⊆ P(X) is 2k-1. We disprove this conjecture by showing that there exists ε > 0 such that for every k and |X| ≥ n
Expand abstract0 (k) there exists a sa...
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- Electronic Journal of Combinatorics Publisher's website
- Journal:
- Electronic Journal of Combinatorics Journal website
- Volume:
- 21
- Issue:
- 3
- Publication date:
- 2014-08-13
- EISSN:
-
1077-8926
- ISSN:
-
1077-8926
- Source identifiers:
-
485524
Item Description
- Keywords:
- Pubs id:
-
pubs:485524
- UUID:
-
uuid:cb6d9e51-b60d-41ee-81a3-9590947daa88
- Local pid:
- pubs:485524
- Deposit date:
- 2016-07-09
Terms of use
- Copyright holder:
- The Electronic Journal of Combinatorics
- Copyright date:
- 2014
- Notes:
-
This is the
published of a journal article published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics in 2014, available online: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i3p22/pdf
If you are the owner of this record, you can report an update to it here: Report update to this record