Localization of spectral Tur\'{a}n-type theorems
M. Rajesh Kannan, Hitesh Kumar, Shivaramakrishna Pragada

TL;DR
This paper develops localized spectral inequalities for graphs, replacing global parameters with local clique-based measures, and verifies these conjectures for specific graph classes, advancing the understanding of spectral extremal properties.
Contribution
It introduces vertex- and edge-localized spectral inequalities, inspired by conjectures, and proves them for diamond-free and random graphs, enriching spectral extremal graph theory.
Findings
Verified localized inequalities for diamond-free graphs.
Established bounds for random graphs.
Proposed strengthened spectral Erdős–Stone–Simonovits theorem.
Abstract
Let be a graph, and let and be a vertex and an edge of , respectively. Define (resp. ) to be the order of the largest clique in containing (resp. ). Denote the adjacency eigenvalues of by . We study localized refinements of spectral Tur\'{a}n-type theorems by replacing global parameters such as the clique number , size and order of with local quantities and . Motivated by a conjecture of Elphick, Linz and Wocjan (2024), we first propose a vertex-localized strengthening of Wilf's inequality: \[ \sqrt{s^{+}(G)} \le \sum_{v\in V(G)}\left(1-\frac{1}{c(v)}\right), \] where . Inspired by the Bollob\'{a}s-Nikiforov conjecture (2007) on the first two eigenvalues, we then introduce an edge-localized analogue: \[\lambda_1^2(G) +…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Spectral Theory in Mathematical Physics · Limits and Structures in Graph Theory
