On the jumping constant conjecture for multigraphs (Q1345881)

Let \(\mathcal D\) be an infinite family of multigraphs with multiplicity of edges not exceeding \(q\), and let \(\mathcal D\) be closed under taking subgraphs. The density \(\tau({\mathcal D})\) of the family \(\mathcal D\) is given by \[ \tau({\mathcal D})= \lim_{n\to \infty} {\max\{| E(G)|: G\in {\mathcal D}\text{ and }| V(G)|= n\}\over {n\choose 2}}. \] \textit{W. G. Brown}, \textit{P. Erdős} and \textit{M. Simonovits} [J. Comb. Theory, Ser. B 15, 77-93 (1973; Zbl 0253.05124)] conjectured that the set of all possible densities of \(\mathcal D\) is well ordered. In the paper under review the conjecture is disproved for all \(q\geq 4\).