Saturation of Berge Hypergraphs

Sean English, Nathan Graber, Pamela Kirkpatrick +2

Given a graph $F$, a hypergraph is a Berge-$F$ if it can be obtained by expanding each edge in $F$ to a hyperedge containing it. A hypergraph $H$ is Berge-$F$-saturated if $H$ does…