The finite Turán threshold conjecture for posets
The finite Turán threshold conjecture for posets
Let be a finite poset. For each , let be the maximum size of a family containing no induced copy of , and define the induced Turán threshold by
Finite Turán threshold conjecture. Every poset has a finite Turán threshold, that is, for every finite poset .
The paper proves finiteness for series-parallel posets and posets of height . The conjecture asks for the corresponding result for arbitrary finite posets.
Sources & referencesView supporting material
Primary source
Linyuan Lu and Kevin G. Milans, “Set families with forbidden subposets”, arXiv:1408.0646 (2014).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.