On an extremal problem for locally sparse multigraphs

TL;DR

This paper asymptotically solves an extremal problem for multigraphs with local sparsity constraints, generalizing previous results and confirming cases of a broader conjecture in graph theory.

Contribution

It provides an asymptotic solution for the maximum product of edge-multiplicities in certain locally sparse multigraphs, extending prior work and resolving a significant case of a conjecture.

Findings

Asymptotic maximum product determined for a broad family of multigraphs.

Generalization of previous results on extremal multigraph problems.

Confirmation of an infinite family of cases of a key conjecture.

Abstract

A multigraph $G$ is an $(s,q)$-graph if every $s$-set of vertices in $G$ supports at most $q$ edges of $G$, counting multiplicities. Mubayi and Terry posed the problem of determining the maximum of the product of the edge-multiplicities in an $(s,q)$-graph on $n$ vertices. We give an asymptotic solution to this problem for the family $(s,q)=(2r, a\binom{2r}{2}+\mathrm{ex}(2r, K_{r+1})-1 )$ with $r, a\in \mathbb{Z}_{\geq 2}$. This greatly generalises previous results on the problem due to Mubayi and Terry and to Day, Treglown and the author, who between them had resolved the special case $r=2$. Our result asymptotically confirms an infinite family of cases in (and overcomes a major obstacle to a resolution of) a conjecture of Day, Treglown and the author.