| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655648 | Journal of Combinatorial Theory, Series A | 2012 | 13 Pages |
Abstract
Given a finite poset P, we consider the largest size La(n,P) of a family of subsets of [n]:={1,…,n} that contains no (weak) subposet P. This problem has been studied intensively in recent years, and it is conjectured that exists for general posets P, and, moreover, it is an integer. For k⩾2 let Dk denote the k-diamond poset {A
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
