Two conjectured strengthenings of Turán's theorem

DOI10.1016/j.laa.2023.12.010arXiv2101.05229OpenAlexW4389720797MaRDI QIDQ6141065

Paweł Wocjan, Clive Elphick, William Linz

Publication date: 22 January 2024

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

clique numberpositive eigenvaluesspectral Turán theorem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Conjectured bounds for the sum of squares of positive eigenvalues of a graph
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
• Upper bounds for the achromatic and coloring numbers of a graph
• An inertial lower bound for the chromatic number of a graph
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Proof of a conjectured lower bound on the chromatic number of a graph
• Lower bounds for the clique and the chromatic numbers of a graph
• On the clique number of integral circulant graphs
• Spectral bounds for the clique and independence numbers of graphs
• Bounds of eigenvalues of graphs
• A bound on the spectral radius of graphs with \(e\) edges
• Cliques and the spectral radius
• Some Inequalities for the Largest Eigenvalue of a Graph
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Cliques in random graphs
• Eigenvalues and triangles in graphs
• Homomorphisms of strongly regular graphs

This page was built for publication: Two conjectured strengthenings of Turán's theorem