The level-count conjecture for forbidden subposets
Let subseteq be a finite poset. Let be the set of functions such that and for all sufficiently large , ordered pointwise. A level is a maximal family on which for every . Define to be the maximum number of levels whose union does not contain as a subposet. Level-count conjecture. For every finite poset ,
This conjecture proposes a common asymptotic explanation for several known forbidden-subposet results, including those for chains, brooms, butterflies, and loops on adjacent levels of the Boolean lattice. Its general validity is not established by the surrounding discussion.
References
- Boris Bukh, “Set families with a forbidden subposet”, arXiv:0803.3840 (2009).
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
No solutions have been posted yet.