Conceptio › Archive › arXiv (All)
arXiv (All) open access

An improved lower bound for the blowup defective chromatic separation constant

Lecomte, Guillaume
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
05c15combinatoricsoptimization-and-control
For a graph $G$ and an integer $d \geq 0$, let $χ^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 $χ(G) = χ^d(G \boxtimes K_{d+1})$ of Guo, Kang and Zwaneveld by exhibiting, for infini
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 1011291
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive