Name
Abstract | ||
|---|---|---|
Let be the poset generated by the subsets of [] with the inclusion relation and let be a finite poset. We want to embed into as many times as possible such that the subsets in different copies are incomparable. The maximum number of such embeddings is asymptotically determined for all finite posets as , where denotes the minimal size of the convex hull of a copy of . We discuss both weak and strong (induced) embeddings. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s11083-014-9342-8 | Order |
Keywords | Field | DocType |
Sperner theorem,Poset,Incomparable copies | Discrete mathematics,Combinatorics,Convex hull,Boolean algebra (structure),Mathematics,Partially ordered set | Journal |
Volume | Issue | ISSN |
32 | 3 | 0167-8094 |
Citations | PageRank | References |
1 | 0.42 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gyula O. H. Katona | 1 | 264 | 66.44 |
| Dániel T. Nagy | 2 | 3 | 1.19 |