2021
DOI: 10.48550/arxiv.2111.10366
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below

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 λ * = β 1/2 + β −1/2 ≈ 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 poi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…Remark After this work is completed, building on our forbidden induced subgraph framework, Jiang and Polyanskii [8] proved Conjecture 1.11 for every λ < λ * , where λ * = β 1/2 + β −1/2 ≈ 2.01980 and β is the unique real root of…”
Section: Theorem 113 Fixmentioning
confidence: 99%
“…Remark After this work is completed, building on our forbidden induced subgraph framework, Jiang and Polyanskii [8] proved Conjecture 1.11 for every λ < λ * , where λ * = β 1/2 + β −1/2 ≈ 2.01980 and β is the unique real root of…”
Section: Theorem 113 Fixmentioning
confidence: 99%
“…If i 2 = 5 or i 2 ≥ 6, then Ṫ7 ⊂ Ġ or Ṫ4 ⊂ Ġ, respectively, contradiction. So, i 2 = 4 and Ġ ⊂ [G 10 5 , v 10 , s]. Subcase 1.4.…”
Section: ⊂ ġmentioning
confidence: 99%
“…, where i 2 = i 1 + 1 and v i 1 − ∼ v i 2 . By subcases 1.1 and 1.3, then Ġ ⊂ [G 10 5 , v 10 , s, v, Ġ], where the pair ( Ġ, v) ∈ {(P 4 , v 2 ), (Q 1,0 , v 1 ), (T a,1,a−1 , v a−1 ), (Q n 1 ,n 1 , v n 1 )} (a ≥ 3 and n 1 ≥ 1).…”
Section: ⊂ ġmentioning
confidence: 99%