A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Partitioning Boolean lattices into antichains
2003
Discrete Mathematics
Let f(n) be the smallest integer t such that a poset obtained from a Boolean lattice with n atoms by deleting both the largest and the smallest elements can be partitioned into t antichains of the same size except for possibly one antichain of a smaller size. In this paper, it is shown that f(n) 6 b n 2 =log n. This is an improvement of the best previously known upper bound for f(n).
doi:10.1016/s0012-365x(02)00448-x
fatcat:7ojs4dj6orfn7gmb2sn5qveggu