Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs
DOI10.1016/J.LAA.2019.08.002zbMATH Open1477.05076OpenAlexW2964912472WikidataQ122913842 ScholiaQ122913842MaRDI QIDQ2332386FDOQ2332386
Authors: Se-Jin Kim, Arthur Mehta
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.08.002
Recommendations
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Operator spaces and completely bounded maps (46L07) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
- Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
- On the Shannon capacity of a graph
- Quantum relations
- Graphs with Given Group and Given Graph-Theoretical Properties
- The sandwich theorem
- Counterexamples to Hedetniemi's conjecture
- Sabidussi versus Hedetniemi for three variations of the chromatic number
- Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
- Lovász theta type norms and operator systems
Cited In (4)
This page was built for publication: Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332386)