The asymptotic forbidden fork-pair conjecture for induced subposets

Let Yk,rY_{k,r} denote the rr-fork with a kk-shaft poset and let Yk,rY'_{k,r} denote its dual. Let La(n,{Yk,r,Yk,r}){\rm La}^{\sharp}(n, \{Y_{k,r},Y'_{k,r}\}) be the maximum size of a family of subsets of [n][n] containing neither Yk,rY_{k,r} nor Yk,rY'_{k,r} as an induced subposet, and let Σ(n,k)\Sigma(n,k) denote the corresponding extremal quantity defined in the paper.

Forbidden fork-pair conjecture. For all k2k \ge 2 and r2r \ge 2, there is an n0=n0(k,r)n_0=n_0(k,r) such that if nn0n\ge n_0, then

La(n,{Yk,r,Yk,r})=Σ(n,k).{\rm La}^{\sharp}(n, \{Y_{k,r}, Y'_{k,r}\}) = \Sigma(n,k).

This proposes a generalization of the theorem proved earlier in the paper for the case of the ordinary fork. The parser supplies no evidence of resolution; the conjecture is therefore recorded as open.

Sources & referencesView supporting material

Primary source

Ryan R. Martin, Abhishek Methuku, Andrew Uzzell and Shanise Walker, “A simple discharging method for forbidden subposet problems”, arXiv:1710.05057 (2017).

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.