Complexity Dichotomies for the Minimum F-Overlay Problem

Nathann Cohen, Frédéric Havet, Dorian Mazauric +2

For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of…