paper

Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines

arXiv:1708.02317 · doi:10.1007/s11856-020-1983-2

Abstract

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let be the family of connected graphs of spectral radius . We show that can be defined by a finite set of forbidden subgraphs if and only if and , where and is the largest root of . The study of forbidden subgraphs characterization for is motivated by the problem of estimating the maximum cardinality of equiangular lines in the -dimensional Euclidean space --- a family of lines through the origin such that the angle between any pair of them is the same. Denote by the maximum number of equiangular lines in with angle . We establish the asymptotic formula for every . In particular, and . Besides we show that for every , which improves a recent result of Balla, Dräxler, Keevash and Sudakov.

23 pages, this version fixes an error in Theorem 1, accepted to Israel J. Math., corrections suggested by the referee have been incorporated

References in corpus (2)

Cited by in corpus (8)