Extremal problems for multigraphs (Q2668012)

An \((n, s, q)\)-graph is an \(n\)-vertex multigraph in which every \(s\)-set of vertices spans at most \(q\) edges. Recently, \textit{D. Mubayi} and \textit{C. Terry} [Comb. Probab. Comput. 28, No. 2, 303--324 (2019; Zbl 1434.05078)] posed the problem of determining the maximum of the product of the edge multiplicities in \((n, s, q)\)-graphs. In this article, a general lower bound construction for this problem is provided for many pairs \((s, q)\). A conjecture of Mubayi and Terry [loc. cit.] is settled on the \((s, q) = (4, 6a + 3)\) case of the problem with \(a\geq 2\). Moreover, the asymptotic behaviour is determined for the problem of sparse multigraphs with \(q\leq 2\binom{s}{2}\) and some possibly useful tools are introduced for attacking the problem in general.