Quick Navigation
Topics
Entanglement Theory Quantum Correlations
Tales of Hoffman: from a distance
arXiv
Authors: Aida Abiad, Jan Meeus
Year
2025
Paper ID
36539
Status
Preprint
Abstract Read
~2 min
Abstract Words
156
Citations
N/A
Abstract
Hoffman proved that a graph G with adjacency eigenvalues λ1geq cdots geq λn and chromatic number χ(G) satisfies χ(G)geq 1+κ, where κ is the smallest integer such that $λ1+sumi=1^κλn+1-ileq 0.We extend this eigenvalue bound to the distance-ksetting, and also show a strengthening of it by proving that it also lower bounds the corresponding quantum distance coloring graph parameter. The new bound depends on a degree-k$ polynomial which can be chosen freely, so one needs to make a good choice of the polynomial to obtain as strong a bound as possible. We thus propose linear programming methods to optimize it. We also investigate the implications of the new bound for the quantum distance chromatic number, showing that it is sharp for some classes of graphs. Finally, we extend the Hoffman bound to the distance setting of the vector chromatic number. Our results extend and unify several previous bounds in the literature.
Why This Paper Matters
- This paper contributes to the Entanglement Theory & Quantum Correlations research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- Hoffman proved that a graph G with adjacency eigenvalues λ1geq cdots geq λn and chromatic number χ(G) satisfies χ(G)geq 1+κ, where κ is the smallest integer such that...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.