Proper conflict-free (degree+2)-choosability conjecture
Every connected graph other than the -cycle is proper conflict-free -choosable; that is, for every list assignment satisfying for all , there exists a coloring such that for every , whenever , and for every non-isolated vertex there is a color with .
References
Source: arXiv
Progress summary
Recent papers improve the conjecture for broader classes of sparse graphs, but the general statement remains open.
The conjecture asserts that every connected graph other than is proper conflict-free -choosable. The full characterization has not been proved.
Known results
- Connected subcubic graphs and connected outerplanar graphs other than satisfy the conjecture.
- Wang and Zhang (2025) proved it for connected -minor-free graphs with maximum degree at most , outer--planar graphs with maximum degree at most , and planar graphs of girth at least .
- Lu et al. (2026) obtained a bounded-average-degree result, including connected graphs other than with .
October 2026 bounded-average-degree improvement
Huijuan Xu reports proper conflict-free -choosability for graphs with maximum average degree less than , with planar graphs of girth at least among the consequences. This is progress on restricted classes, not a resolution of the full conjecture, and the claim has not been independently verified here.
Current status (as of November 2026): The conjecture is open in general; several sparse graph classes are settled, while the October 2026 bounded-average-degree advance remains an unverified partial result.
Solutions 0
No solutions have been posted yet.