The Feasibility Problem -- the family $\mathcal{F}$$(G)$ of all induced $G$-free graphs

Yair Caro, Matthew Cassar, Josef Lauri +1

An infinite family of graphs $\mathcal{F}$ is called feasible if for any pair of integers $(n,m)$, $n\ge 1$, $0\le m\le \left(\genfrac{}{}{0ex}{}{n}{2}\right)$, there is a member $G\in \mathcal{F}$ such th…