English

A structure theory for signed graphs with fixed smallest eigenvalue

Combinatorics 2026-02-25 v1

Abstract

In this paper, we will give a structure theory for signed graphs with fixed smallest eigenvalue and investigate signed graphs with smallest eigenvalue greater than 12-1-\sqrt{2}. Given a real number λ1\lambda\leq -1, we show that the following hold for each signed graph (G,σ)(G,\sigma) with smallest eigenvalue at least λ\lambda and large minimum valency: (i)\mathrm{(i)} there exist dense induced subgraphs N1,,NrN_1, \dots, N_r in (G,σ)(G,\sigma) such that each vertex lies in at most λ\lfloor -\lambda\rfloor NiN_i's and almost all edges of (G,σ)(G,\sigma) lie in at least one of the NiN_i's; (ii)\mathrm{(ii)} if λ>12\lambda>-1-\sqrt{2}, then (G,σ)(G,\sigma) has smallest eigenvalue at least 2-2 and (G,σ)(G,\sigma) is 11-integrable.

Keywords

Cite

@article{arxiv.2602.20783,
  title  = {A structure theory for signed graphs with fixed smallest eigenvalue},
  author = {Jack H. Koolen and Jing-Yuan Liu and Qianqian Yang and Meng-Yue Cao},
  journal= {arXiv preprint arXiv:2602.20783},
  year   = {2026}
}
R2 v1 2026-07-01T10:49:43.244Z