We prove that the number of multigraphs with vertex set {1, . . ., n} such that every four vertices span at most nine edges is an2+o(n2) where a is transcendental (assuming Schanuel's conjecture from number theory). This is an easy consequence of the solution to a related problem about maximizing the product of the edge multiplicities in certain multigraphs, and appears to be the first explicit (somewhat natural) question in extremal graph theory whose solution is transcendental. These results may shed light on a question of Razborov, who asked whether there are conjectures or theorems in extremal combinatorics which cannot be proved by a certain class of finite methods that include Cauchy–Schwarz arguments.

Our proof involves a novel application of Zykov symmetrization applied to multigraphs, a rather technical progressive induction, and a straightforward use of hypergraph containers.

Bergelson and Tao have recently proved that if G is a D-quasi-random group, and x, g are drawn uniformly and independently from G, then the quadruple (g, x, gx, xg) is roughly equidistributed in the subset of G4 defined by the constraint that the last two coordinates lie in the same conjugacy class. Their proof gives only a qualitative version of this result. The present note gives a rather more elementary proof which improves this to an explicit polynomial bound in D−1.