Inertia, independence and expanders

Abstract Let be a graph on vertices, independence number , Lovász theta function and Shannon capacity . We define to be the minimum number of non‐negative eigenvalues taken over all Hermitian weighted adjacency matrices of . It is well known that and . Continuing a long line of work, we investigate the relationships between , , and . We prove a conjecture of Kwan and Wigderson, showing that for every integer , there exists a graph with and . In addition, we prove that for every integer , there exists a graph with and . Both results rely on a new observation: if the complement of contains a good spectral expander, then must be large. Moreover, we show that the multiplicative gap between and can be . We also show that can be exponentially larger than , improving a recent result of Ihringer.

Authors

Institutions

Publication Details

Journal
Bulletin of the London Mathematical Society
Published
2025-08-29
DOI
https://doi.org/10.1112/blms.70185
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Inertia, independence and expanders

Clive Elphick, Shengtong Zhang, Q.W Tang
Bulletin of the London Mathematical Society
Advanced Graph Theory Research
article

Inertia, independence and expanders

Clive Elphick, Shengtong Zhang, Q.W Tang
article en

Abstract

Abstract Let be a graph on vertices, independence number , Lovász theta function and Shannon capacity . We define to be the minimum number of non‐negative eigenvalues taken over all Hermitian weighted adjacency matrices of . It is well known that and . Continuing a long line of work, we investigate the relationships between , , and . We prove a conjecture of Kwan and Wigderson, showing that for every integer , there exists a graph with and . In addition, we prove that for every integer , there exists a graph with and . Both results rely on a new observation: if the complement of contains a good spectral expander, then must be large. Moreover, we show that the multiplicative gap between and can be . We also show that can be exponentially larger than , improving a recent result of Ihringer.

Bulletin of the London Mathematical SocietyVol. 57(12)
University of Birmingham (GB), Xi'an Jiaotong University (CN), Stanford University (US)
National Science Foundation
Openalex Percentile: Top 76%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.