New eigenvalue bound for the fractional chromatic number
From MaRDI portal
Publication:6201030
DOI10.1002/jgt.23071arXiv2211.04499OpenAlexW4390341447MaRDI QIDQ6201030
Publication date: 25 March 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.04499
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
- Spectra of uniform hypergraphs
- An inertial lower bound for the chromatic number of a graph
- On the chromatic number of a simplicial complex
- Proof of a conjectured lower bound on the chromatic number of a graph
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
- Eigenvalues and colorings of digraphs
- Chromatic number and spectral radius
- More tales of Hoffman: bounds for the vector chromatic number of a graph
- Spectral lower bounds for the quantum chromatic number of a graph
- Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- A comparison of the Delsarte and Lovász bounds
- On some inequalities for accretive-dissipative matrices
- The Eigenvalues of a Graph and Its Chromatic Number
- Spectral bounds for the quantum chromatic number of quantum graphs
This page was built for publication: New eigenvalue bound for the fractional chromatic number