On an extremal problem involving a pair of forbidden posets

Resolving a conjecture of Methuku and the first author we determine the size of the largest family of subsets of an $n$-element set avoiding both $Y_k$ and $Y_k^{\mathrm{\prime }}$ as induced subposets. The result follows as a consequence of the analogous result on a cyclical grid poset.