Coloring an Orthogonality Graph

DOI10.1137/050639715zbMath1167.05314arXivmath/0509151OpenAlexW2120490860MaRDI QIDQ3629469

Chris D. Godsil, Michael W. Newman

Publication date: 27 May 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0509151

zbMATH Keywords

graph coloringmaximum independent setsorthogonality graphratio boundquantum telepathy

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Deterministic quantum non-locality and graph colorings ⋮ Towards characterizing the non-locality of entangled quantum states ⋮ Classical, quantum and nonsignalling resources in bipartite games ⋮ New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix ⋮ Distinguishing orthogonality graphs ⋮ Violating the Shannon capacity of metric graphs with entanglement ⋮ Quantum contextuality with stabilizer states ⋮ Commutative association schemes ⋮ The automorphism group and fixing number of orthogonality graph over a vector space

This page was built for publication: Coloring an Orthogonality Graph