English

Local version of Vizing's theorem for multi-graphs

Combinatorics 2024-05-03 v2

Abstract

Extending a result of Christiansen, we prove that every mutli-graph G=(V,E)G=(V,E) admits a proper edge colouring ϕ:E{1,2,}\phi:E\to \{1,2,\dots\} which is local, that is, ϕ(e)max{d(x)+π(x),d(y)+π(y)}\phi(e)\le \max\{d(x)+\pi(x),d(y)+\pi(y)\} for every edge ee with end-points x,yVx,y\in V, where d(z)d(z) (resp.\ π(z)\pi(z)) denotes the degree of a vertex zz (resp.\ the maximum edge multiplicity at zz). This is derived from a local version of the Fan Equation.

Keywords

Cite

@article{arxiv.2306.04173,
  title  = {Local version of Vizing's theorem for multi-graphs},
  author = {Clinton T. Conley and Jan Grebik and Oleg Pikhurko},
  journal= {arXiv preprint arXiv:2306.04173},
  year   = {2024}
}

Comments

10 pages, minor revision

R2 v1 2026-06-28T10:58:28.471Z