arXiv (All)
open access
An improved lower bound for the blowup defective chromatic separation constant
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
- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound#1119096
- Large values of $L(σ,χ)$ over sets of characters with small product set#1076852
- Revisiting the outer-weakly convex domination number in graph products#163085
- Hadwiger--Nelson Problem for Typical Norms#1131062
- Perfect Matching in Product Graphs and in their Random Subgraphs#821390
Record · ID 1011291
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
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
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive