On an extremal problem involving a pair of forbidden posets

Abstract

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^{\prime }$ as induced subposets. The result follows as a consequence of the analogous result on a cyclical grid poset.

References in corpus (2)

• Largest family without A union B contained in C intersect D
• A simple discharging method for forbidden subposet problems

Cited by in corpus (1)

• A simple discharging method for forbidden subposet problems