A Proof of the Chen--Raspaud Conjecture

Abstract

For every integer $k\ge 2$, Chen and Raspaud conjectured that each graph $G$ with odd girth $\og(G)\ge2k+1$ and maximum average degree $\mad(G)<2+1/k$ has a $(2k+1:k)$-coloring. In this paper, we prove the conjecture.