A Polynomial Upper Bound for Poset Saturation

Paul Bastide, Carla Groenland, Maria-Romina Ivan +1

Given a finite poset $\mathcal{P}$, we say that a family $\mathcal{F}$ of subsets of $[n]$ is $\mathcal{P}$-saturated if $\mathcal{F}$ does not contain an induced copy of $\mathcal{P}$,…