Exact forbidden subposet results using chain decompositions of the cycle (Q907216)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact forbidden subposet results using chain decompositions of the cycle |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact forbidden subposet results using chain decompositions of the cycle |
scientific article |
Statements
Exact forbidden subposet results using chain decompositions of the cycle (English)
0 references
25 January 2016
0 references
Summary: We introduce a method of decomposing the family of intervals along a cyclic permutation into chains to determine the size of the largest family of subsets of \([n]\) not containing one or more given posets as a subposet. De Bonis, Katona and Swanepoel determined the size of the largest butterfly-free family. We strengthen this result by showing that, for certain posets containing the butterfly poset as a subposet, the same bound holds. We also obtain the corresponding LYM-type inequalities.
0 references
forbidden subposet
0 references
extremal set theory
0 references
cycle method
0 references
Sperner theory
0 references
0 references
0.810346245765686
0 references
0.793133020401001
0 references
0.7845009565353394
0 references
0.7736270427703857
0 references
0.7674704790115356
0 references
