Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912632724783104 |
|---|---|
| author | Jiang, Zilin Polyanskii, Alexandr |
| author_facet | Jiang, Zilin Polyanskii, Alexandr |
| contents | 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 $λ^* = ρ^{1/2} + ρ^{-1/2} \approx 2.01980$, and $ρ$ is the unique real root of $x^3 = x + 1$. 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 $[-2, \infty)$.
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 $N_{α, β}(n)$ the maximum number of unit vectors in $\mathbb{R}^d$ where all pairwise inner products lie in $\{α, β\}$ with $-1 \le β< 0 \le α< 1$. Very recently Jiang, Tidor, Yao, Zhang and Zhao determined the limit of $N_{α, β}(d)/d$ as $d\to\infty$ when $α+ 2β< 0$ or $(1-α)/(α-β) \in \{1,\sqrt2,\sqrt3\}$, and they proposed a conjecture on the limit in terms of eigenvalue multiplicities of signed graphs. We establish their conjecture whenever $(1-α)/(α- β) < λ^*$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2111_10366 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below Jiang, Zilin Polyanskii, Alexandr Combinatorics Metric Geometry 05C50, 05D10, 52C35 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 $λ^* = ρ^{1/2} + ρ^{-1/2} \approx 2.01980$, and $ρ$ is the unique real root of $x^3 = x + 1$. 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 $[-2, \infty)$. 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 $N_{α, β}(n)$ the maximum number of unit vectors in $\mathbb{R}^d$ where all pairwise inner products lie in $\{α, β\}$ with $-1 \le β< 0 \le α< 1$. Very recently Jiang, Tidor, Yao, Zhang and Zhao determined the limit of $N_{α, β}(d)/d$ as $d\to\infty$ when $α+ 2β< 0$ or $(1-α)/(α-β) \in \{1,\sqrt2,\sqrt3\}$, and they proposed a conjecture on the limit in terms of eigenvalue multiplicities of signed graphs. We establish their conjecture whenever $(1-α)/(α- β) < λ^*$. |
| title | Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below |
| topic | Combinatorics Metric Geometry 05C50, 05D10, 52C35 |
| url | https://arxiv.org/abs/2111.10366 |