A note on saturation for Berge-G hypergraphs

Maria Axenovich, Christian Winter

For a graph G, a hypergraph H is called Berge-G if there is a hypergraph H', isomorphic to H, containing all vertices of G, so that e is contained in f(e) for each edge e of G, whe…