Spectral lower bounds for the orthogonal and projective ranks of a graph
From MaRDI portal
Publication:2323822
zbMath1419.05136arXiv1806.02734MaRDI QIDQ2323822
Publication date: 12 September 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.02734
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum homomorphisms
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- An inertial lower bound for the chromatic number of a graph
- The smallest eigenvalue of the signless Laplacian
- Random symmetric matrices are almost surely nonsingular.
- Unified spectral bounds on the chromatic number
- On the quantum chromatic number of a graph
- More tales of Hoffman: bounds for the vector chromatic number of a graph
- Topological bounds on the dimension of orthogonal representations of graphs
- Spectral lower bounds for the quantum chromatic number of a graph
- Graph homomorphisms via vector colorings
- Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory
- Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number
- Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants
- Approximate graph coloring by semidefinite programming
- On the Shannon capacity of a graph
- Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
- QUANTUM CHROMATIC NUMBERS VIA OPERATOR SYSTEMS
- Estimating quantum chromatic numbers
This page was built for publication: Spectral lower bounds for the orthogonal and projective ranks of a graph
