The finite Turán threshold conjecture for posets

About 12 years old · traced to

Let PP be a finite poset. For each nn, let La∗(n,P){\rm La}^{*}(n,P) be the maximum size of a family F⊆2[n]\mathcal{F}\subseteq 2^{[n]} containing no induced copy of PP, and define the induced Turán threshold by

π∗(P)=lim sup⁡n→∞La∗(n,P)(n⌊n/2⌋).\pi^{*}(P)=\limsup_{n\to\infty}\frac{{\rm La}^{*}(n,P)}{\binom{n}{\lfloor n/2\rfloor}}.

Finite Turán threshold conjecture. Every poset has a finite Turán threshold, that is, π∗(P)<∞\pi^{*}(P)<\infty for every finite poset PP.

The paper proves finiteness for series-parallel posets and posets of height 22. The conjecture asks for the corresponding result for arbitrary finite posets.

References

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.