Abstract
For a family of subsets of , the Lubell function is defined as $\hb_n(\F):=\sum_{F\in\F}\binom{n}{|F|}^{-1}$. In \cite{GriLiLu}, Griggs, Lu, and the author conjectured that if a family $\F$ of subset of does not contain four distinct sets , , and forming a diamond, namely and , then $\hb_n(\F)\le 2+\lfloor\frac{n^2}{4}\rfloor/(n^2-n)$. Moreover, the upped bound is achieved by three types of families. In this paper, we prove the upper bound in the conjecture is asymptotically correct. In addition, we give some results related to the problem of maximizing the Lubell function for the poset-free families.
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.