Preprint
Oct 2026
NP-hardness of additive approximation for generalized Tur\'{a}n problems
Given a graph $T$ and a nonempty family $\mathcal{F}$ of graphs, let $\operatorname{ex}(G, T, \mathcal{F})$ denote the maximum number of copies of $T$ in an $\mathcal{F}$-free subgraph of a host graph $G$. Alon and Shikhelman [Algorithmica, 2022] conjectured that if $e(T)>0$ and no member of $\mathcal{F}$ is a subgraph...
Yi-Han Chen, Jia-Lin He, Xi-He Li et al.
· 1 citation
· ⚡1