Year: 2026
Type: preprint
Abstract: For every integer $k\ge2$, 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.
Source: arXiv (Cornell University)
Institution: Jiangsu Normal University
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G2405134708, G5861376312
OpenAlex ID: W7203708848
Cites:
Cited by:
Related to: