Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs

DOI10.1016/j.laa.2019.08.002zbMath1477.05076OpenAlexW2964912472WikidataQ122913842 ScholiaQ122913842MaRDI QIDQ2332386

Arthur Mehta, Se-Jin Kim

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

zbMATH Keywords

graph theoryquantum graphsoperator systemsLovász theta functionnon-commutative graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Operator spaces and completely bounded maps (46L07) Coloring of graphs and hypergraphs (05C15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items

The quantum-to-classical graph homomorphism game, Spectral bounds for the quantum chromatic number of quantum graphs, Connectivity for quantum graphs

Cites Work

• The sandwich theorem
• Sabidussi versus Hedetniemi for three variations of the chromatic number
• Counterexamples to Hedetniemi's conjecture
• Lovász theta type norms and operator systems
• Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
• Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
• Graphs with Given Group and Given Graph-Theoretical Properties
• On the Shannon capacity of a graph
• A von Neumann Algebra Approach to Quantum Metrics/Quantum Relations