A finite forbidden family with superlinear surplus and no three-factor product extremizers
arXiv:2608.15777
Abstract
We construct a fixed finite family of ordinary forbidden subgraphs with and a constant such that at every sufficiently large order. Nevertheless, the complement of every sufficiently large -extremal graph has at most two connected components. In particular, no such extremal graph is a complete join of three graphs of positive order. This gives a negative answer to a natural existence-only question motivated by the Simonovits Product Conjecture, in which one asks only for one product extremizer at each sufficiently large order.
8 pages