On Vizing’s problem for triangle-free graphs

Abstract

We prove that (Formula presented) for any triangle-free graph G of maximum degree ∆ provided ∆ ⩾ 524. This gives tangible progress towards an old problem of Vizing, in a form cast by Reed. We use a method of Hurley and Pirot, which in turn relies on a new counting argument of the second author.