NP-hardness of additive approximation for generalized Turán problems

Yihan Chen, Jialin He, Xihe Li +2

For a fixed graph $T$ and a fixed nonempty family $\mathcal{F}$ of graphs, let $\mathrm{ex}(G,T,\mathcal{F})$ denote the maximum number of copies of $T$ in an $\mathcal{F}$…