arXiv (All)
open access
A counterexample to the quantum Hedetniemi conjecture
Godsil, Roberson, Šámal and Severini conjectured that the quantum chromatic number of the categorical product of two graphs equals the minimum of the quantum chromatic numbers of the factors. We disprove this conjecture: we construct explicit finite graphs $G,H$ with \[ χ(G\times H) \leq 1538 < 1539
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
- On Edge Coloring of Multigraphs#1082904
- Prime and Nonprime Totatives: A Sharp Construction and Exact Thresholds#1083347
- A counterexample to the Fang--Lin conjecture: Edge and spectral extremality diverge near a Turán graph#1132409
- A solution to a conjecture on the signless Laplacian spectral radius for $t$-color-critical graphs#1035773
- Logarithmic basis number of graphs and regular matroids#1084361
Record · ID 1034490
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