Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below
Zilin Jiang, Alexandr Polyanskii

TL;DR
This paper characterizes when graphs and signed graphs with eigenvalues bounded from below can be described by a finite set of forbidden induced subgraphs, resolving a longstanding question and linking spectral properties to structural graph theory.
Contribution
It proves that the family of graphs with smallest eigenvalue at least -λ is finitely characterized by forbidden subgraphs if and only if λ < λ*, and extends this to signed graphs, also determining limits for spherical two-distance sets.
Findings
Finite forbidden subgraph characterization holds for λ < λ*
Identifies all limit points of smallest eigenvalues of graphs
Establishes conjecture for signed graphs when (1-α)/ (α-β) < λ*
Abstract
The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least can be defined by a finite set of forbidden induced subgraphs if and only if , where , and is the unique real root of . This resolves a question raised by Bussemaker and Neumaier. As a byproduct, we find all the limit points of smallest eigenvalues of graphs, supplementing Hoffman's work on those limit points in . We also prove that the same conclusion about forbidden subgraph characterization holds for signed graphs. Our impetus for the study of signed graphs is to determine the maximum cardinality of a spherical two-distance set with two fixed angles (one acute and one obtuse) in high dimensions. Denote by…
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 · graph theory and CDMA systems · Finite Group Theory Research
