Abstract
Let be the maximum size of a family of subsets of not containing as a (weak) subposet, and let be the length of a longest chain in . The best known upper bound for in terms of and is due to Chen and Li, who showed that for any fixed . In this paper we show that for any fixed , improving the best known upper bound. By choosing appropriately, we obtain that as a corollary, which we show is best possible for general . We also give a different proof of this corollary by using bounds for generalized diamonds. We also show that the Lubell function of a family of subsets of not containing as an induced subposet is for every .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.