Decompositions of partially ordered sets into chains and antichains of given size |
| |
| Authors: | Yair Caro Zsolt Tuza |
| |
| Affiliation: | (1) School of Mathematics, Tel Aviv University, Israel;(2) Computer and Automation Institute, Kende u. 13-17, H-1111 Budapest, Hungary |
| |
| Abstract: | Every partially ordered set P on at least (1+o(1))n3 elements can be decomposed into subposets of size n that are  almost chains or antichains. This lower bound on P is asymptotically best possible. Similar results are presented for other types of combinatorial structures.Research supported in part by the AKA Research Fund of the Hungarian Academy of Sciences, grant 1-3-86-264. |
| |
| Keywords: | 05C55 05C70 06A10 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
