Metraipolis › archive › dc_e606020f07db

An improved lower bound for the blowup defective chromatic separation constant — arXiv:2609.17557

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.17557
License (as archived)
CC0-1.0
Archived
2026-10-15T15:40:27.490Z
SHA-256 of the archived text
40fa4dec08bf6d880ab9bb9870819d1bc27bd2ce4709b14c062cf6c4c67d09ce
Stable URL of this page
https://metraipolis.com/documento/dc_e606020f07db

How to cite

An improved lower bound for the blowup defective chromatic separation constant — arXiv:2609.17557 — arXiv (en), https://arxiv.org/abs/2609.17557 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e606020f07db (Metraipolis archive dc_e606020f07db, sha256 40fa4dec08bf6d880ab9bb9870819d1bc27bd2ce4709b14c062cf6c4c67d09ce)
BibTeX
@misc{dce606020f07db,
  title = {An improved lower bound for the blowup defective chromatic separation constant — arXiv:2609.17557},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.17557},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e606020f07db; sha256 40fa4dec08bf6d880ab9bb9870819d1bc27bd2ce4709b14c062cf6c4c67d09ce},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17557. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a graph $G$ and an integer $d \geq 0$, let $\chi^d(G)$ denote the $d$-defective chromatic number, and let $G \boxtimes K_{d+1}$ be the $(d+1)$-fold clique blowup of $G$. Norin and Steiner disproved the conjecture $\chi(G) = \chi^d(G \boxtimes K_{d+1})$ of Guo, Kang and Zwaneveld by exhibiting, for infinitely many $d$, graphs with $\chi(G) \geq (30/29) \chi^d(G \boxtimes K_{d+1})$, and they proved the universal upper bound $\chi(G) \leq 2 \chi^d(G \boxtimes K_{d+1})$. Writing $C_d = \sup_G \chi(G)/\chi^d(G \boxtimes K_{d+1})$ and $C^* = \sup_d C_d$, their results give $C^* \in [30/29, 2]$. We improve the lower bound: we exhibit an explicit 40-vertex graph $W$ with $\chi(W) = 11$ and $\chi^2(W \boxtimes K_3) = 10$, so that $C^* \geq C_2 \geq 11/10 > 30/29$, already at the smallest defect for which such a separation is possible, namely $d = 2$. All parameters are established by the proofs; the only computer-assisted input, the non-list-colourability of a certain 30-vertex, 10-colour list instance $(B,L)$, is certified by an independently checkable DRAT refutation.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.OC).
Categorie arXiv: Combinatorics (math.CO) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.17557 — 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-15T15:08:22.613Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).