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

From MaRDI portal
Publication:6233471

arXiv1206.0806MaRDI QIDQ6233471FDOQ6233471


Authors: Wei-Tian Li Edit this on Wikidata


Publication date: 4 June 2012

Abstract: For a family of subsets of [n]:=1,2,...,n, the Lubell function is defined as . In cite{GriLiLu}, Griggs, Lu, and the author conjectured that if a family F of subset of [n] does not contain four distinct sets A, B, C and D forming a diamond, namely AsubsetBcapC and BcupCsubsetD, then hbn(F)le2+lfloorfracn24floor/(n2n). 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.













This page was built for publication: The Asymptotic Bound of the Lubell Function for Diamond-free Families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233471)