An inertial lower bound for the chromatic number of a graph
From MaRDI portal
Publication:521386
zbMath1358.05104arXiv1605.01978MaRDI QIDQ521386
Publication date: 10 April 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.01978
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Related Items (9)
A characterization and an application of weight-regular partitions of graphs ⋮ Two conjectured strengthenings of Turán's theorem ⋮ Spectral bounds for the quantum chromatic number of quantum graphs ⋮ New eigenvalue bound for the fractional chromatic number ⋮ On the difference of energies of a graph and its complement graph ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ Spectral lower bounds for the orthogonal and projective ranks of a graph ⋮ Spectral lower bounds for the quantum chromatic number of a graph ⋮ Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming
Cites Work
- Unnamed Item
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- Extrema of graph eigenvalues
- The smallest eigenvalue of the signless Laplacian
- Spectra of graphs
- 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
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
- A survey of Nordhaus-Gaddum type relations
- 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
- On Complementary Graphs
- Erdős–Ko–Rado Theorems: Algebraic Approaches
This page was built for publication: An inertial lower bound for the chromatic number of a graph
