The finite Lubell threshold conjecture for posets

Let PP be a finite poset and let F2[n]\mathcal{F}\subseteq 2^{[n]}. Define the Lubell function by

(F)=AF1(nA).\ell(\mathcal{F})=\sum_{A\in\mathcal{F}}\frac{1}{\binom{n}{|A|}}.

The Lubell threshold of PP is

λ(P)=lim supn{(F):F2[n] and F is P-free}.\lambda^{*}(P)=\limsup_{n\to\infty}\{\ell(\mathcal{F}):\mathcal{F}\subseteq 2^{[n]}\text{ and }\mathcal{F}\text{ is }P\text{-free}\}.

Finite Lubell threshold conjecture. Every poset has a finite Lubell threshold, that is, λ(P)<\lambda^{*}(P)<\infty for every finite poset PP.

The paper notes that finiteness of the Lubell threshold implies finiteness of the Turán threshold and proves finite Lubell-threshold results for certain classes of posets. The conjecture remains open for general posets.

Sources & referencesView supporting material

Primary source

Linyuan Lu and Kevin G. Milans, “Set families with forbidden subposets”, arXiv:1408.0646 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.