The Saturation Number of Induced Subposets of the Boolean Lattice

Michael Ferrara, Bill Kay, Lucas Kramer +4

Given a poset $P$, a family $F$ of elements in the Boolean lattice is said to be $P$-saturated if (1) $F$ contains no copy of $P$ as a subposet and (2) every proper superset of $F$…