Counting Small Induced Subgraphs with Edge-monotone Properties

Simon Döring, Dániel Marx, Philip Wellnitz

We study the parameterized complexity of #IndSub($\Phi$), where given a graph $G$ and an integer $k$, the task is to count the number of induced subgraphs on $k$ vertices that satisfy…