Metraipolis › archive › dc_27acfca2cb6f
Proper Conflict-Free Choosability for Graphs with Bounded Average Degree — arXiv:2608.29375
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.29375
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T09:31:01.752Z
- SHA-256 of the archived text
663d3ee2468ebe3328f2cf582b810818fb842d71ffa54d86a18b298384778ced- Stable URL of this page
https://metraipolis.com/documento/dc_27acfca2cb6f
How to cite
Proper Conflict-Free Choosability for Graphs with Bounded Average Degree — arXiv:2608.29375 — arXiv (en), https://arxiv.org/abs/2608.29375 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_27acfca2cb6f (Metraipolis archive dc_27acfca2cb6f, sha256 663d3ee2468ebe3328f2cf582b810818fb842d71ffa54d86a18b298384778ced)
BibTeX
@misc{dc27acfca2cb6f,
title = {Proper Conflict-Free Choosability for Graphs with Bounded Average Degree — arXiv:2608.29375},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.29375},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_27acfca2cb6f; sha256 663d3ee2468ebe3328f2cf582b810818fb842d71ffa54d86a18b298384778ced},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29375. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a graph $G$, a proper coloring of $G$ is called proper conflict-free if for every non-isolated vertex $u$, there is at least one color appearing exactly once in $N_G(u)$. A graph $G$ is proper conflict-free $f$-choosable if for every list assignment $L$ with $|L(v)|\ge f(v)$ for each vertex $v$, $G$ admits a proper conflict-free $L$-coloring. Recently, Kashima, Škrekovski, and Xu proposed a conjecture on proper conflict-free list coloring. For a graph $G$, let $\kappa_G:V(G)\to \mathbb{N}$ be defined by \[ \kappa_G(v)= \begin{cases} 4, & \text{if } d_G(v)=2,\\[4pt] d_G(v)+1, & \text{if } d_G(v)\neq 2. \end{cases} \] They conjectured that every connected graph other than $C_5$ is proper conflict-free $\kappa_G$-choosable. In this paper, we confirm this conjecture in two classes of graphs with bounded average degree, thereby generalizing results of Kashima, Škrekovski, and Xu and of Wang and Zhang. We prove that every connected graph $G\neq C_5$ with either $\operatorname{mad}(G)<\frac{12}{5}$ or $\Delta(G)\le3$ is proper conflict-free $\kappa_G$-choosable. To prove these results, we introduce a method based on systems of proper conflict-free representatives and develop a construction of auxiliary graphs that preserves the maximum average degree bound.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.29375 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T09:02:28.824Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).