The Asymptotic Bound of the Lubell Function for Diamond-free Families

preprint2012arXivOpen access

Abstract

For a family of subsets of [n]:=1,2,...,n[n]:={1,2,...,n}, 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 [n][n] does not contain four distinct sets AA, BB, CC and DD forming a diamond, namely A⊂B∩CA\subset B\cap C and B∪C⊂DB\cup C\subset D, 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.