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...
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | Journal article |
| প্রকাশিত: |
Electronic Journal of Combinatorics
2014
|