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
- Version:
- Publisher's version
Actions
Access Document
- Files:
-
-
(pdf, 367.5KB)
-
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Electronic Journal of Combinatorics Publisher's website
- Journal:
- Electronic Journal of Combinatorics Journal website
- Volume:
- 21
- Issue:
- 3
- Chapter number:
- ARTN P3.22
- Publication date:
- 2014-08-13
- EISSN:
-
1077-8926
- ISSN:
-
1077-8926
- URN:
-
uuid:cb6d9e51-b60d-41ee-81a3-9590947daa88
- Source identifiers:
-
485524
- Local pid:
- pubs:485524
- Paper number:
- 3
Item Description
- Keywords:
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