A polynomial resultant approach to algebraic constructions of extremal graphs

Tao Zhang, Zixiang Xu, Gennian Ge

The Turán problem asks for the largest number of edges ex$(n,H)$ in an $n$-vertex graph not containing a fixed forbidden subgraph $H$, which is one of the most important problems…