Average degrees of edge-$Δ$-critical multigraphs

Abstract

Let $G$ be a loopless multigraph with maximum degree $Δ(G)$, average degree $\overline{d}(G)$, density $Γ(G)$, and chromatic index $χ'(G)$. A multigraph $G$ is called edge-$Δ$-critical if $Δ(G)=Δ$, $χ'(G)=Δ(G)+1$ and $χ'(H) \le Δ(G)$ for every proper subgraph $H\subset G$. Vizing conjectured that if $G$ is an edge-$Δ$-critical simple graph on $n$ vertices, then $\overline{d}(G) \ge Δ-1+\tfrac{3}{n}$. Motivated by this, we conjecture that every edge-$Δ$-critical multigraph $G$ satisfies $\overline{d}(G) \ge \tfrac{2Δ+2}{3}$, which is best possible. We first give a general lower bound in this direction. For any such graph $G$, \[ \overline{d}(G) \ge \begin{cases} \frac{\sqrt{17}-3}{2}(Δ+1) & \text{if } Δ\le 112;\\[4pt] \frac{Δ+\sqrt{2Δ-1}}{2} & \text{if } Δ\ge 113. \end{cases} \] This bound can be further improved under an additional condition on the multiplicity $μ$. In this case, \[ \overline{d}(G)\ge \min\left\{ \frac{2μΔ+2μ(2μ-1)}{4μ-1},\; \frac{\sqrt{17}-3}{2}(Δ+1) \right\}. \] We also confirm the conjecture for $Δ\in \{2,3,4,5,6,7,8\}$. As a consequence, Goldberg's conjecture~\cite{Goldberg1984} holds for $Δ(G)\in\{2,3,4,5\}$, that is, every multigraph $G$ with $χ'(G)\ge Δ(G)+1$ satisfies $Γ(G)\ge Δ(G)$.