Nagy, Dániel (2018) Forbidden subposet problems with size restrictions. JOURNAL OF COMBINATORIAL THEORY SERIES A, 155. pp. 42-66. ISSN 0097-3165
|
Text
1608.06646v1.pdf Download (242kB) | Preview |
Abstract
Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are closely related to the forbidden subposet problems, where the avoided configurations are described solely by inclusions. © 2017 Elsevier Inc.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | boolean lattice; Extremal set theory; Forbidden subposet; Set family; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 13 Jan 2019 18:52 |
| Last Modified: | 13 Jan 2019 18:52 |
| URI: | http://real.mtak.hu/id/eprint/89808 |
Actions (login required)
 |
Edit Item |
