Gerbner, Dániel and Keszegh, Balázs and Lemons, Nathan and Palmer, Cory and Pálvölgyi, Dömötör and Patkós, Balázs (2013) Saturating Sperner families. GRAPHS AND COMBINATORICS, 29 (5). pp. 1355-1364. ISSN 0911-0119
|
Text
1105.4453v1.pdf Available under License Creative Commons Attribution. Download (163kB) | Preview |
Official URL: https://doi.org/10.1007/s00373-012-1195-6
Abstract
A family F ⊆ 2[n] saturates the monotone decreasing property P if F satisfies P and one cannot add any set to F such that property P is still satisfied by the resulting family. We address the problem of finding the minimum size of a family saturating the k-Sperner property and the minimum size of a family that saturates the Sperner property and that consists only of l-sets and (l + 1)-sets.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Saturation; Extremal set theory; Sperner property; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 25 Jun 2024 13:39 |
| Last Modified: | 25 Jun 2024 13:39 |
| URI: | https://real.mtak.hu/id/eprint/198674 |
Actions (login required)
 |
Edit Item |
