More tales of Hoffman: bounds for the vector chromatic number of a graph

DOI10.7151/dmgt.2358zbMath1504.05100arXiv1812.02613OpenAlexW2902384493MaRDI QIDQ2107750

David Anekstein, Clive Elphick, Paweł Wocjan

Publication date: 2 December 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

spectral boundsvector chromatic number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

New eigenvalue bound for the fractional chromatic number ⋮ Spectral lower bounds for the orthogonal and projective ranks of a graph ⋮ More tales of Hoffman: bounds for the vector chromatic number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
• The smallest eigenvalue of the signless Laplacian
• Proof of a conjectured lower bound on the chromatic number of a graph
• Unified spectral bounds on the chromatic number
• Chromatic number and spectral radius
• Spectral characterizations of the Lovász number and the Delsarte number of a graph
• Sabidussi versus Hedetniemi for three variations of the chromatic number
• More tales of Hoffman: bounds for the vector chromatic number of a graph
• Spectral lower bounds for the orthogonal and projective ranks of a graph
• 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
• Approximate graph coloring by semidefinite programming
• On the Shannon capacity of a graph
• Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
• Matrix inequalities

This page was built for publication: More tales of Hoffman: bounds for the vector chromatic number of a graph