Inertia, Independence and Expanders
Abstract
Let G be a graph on n vertices, independence number α(G), Lov\'asz theta function (G), and Shannon capacity (G). We define n0(G) to be the minimum number of non-negative eigenvalues taken over all Hermitian weighted adjacency matrices of G. It is well known that α(G) (G) (G) and α(G) n0(G). Continuing a long line of work, we investigate the relationships between α(G) , (G) , (G), and n 0(G) . We prove a conjecture of Kwan and Wigderson, showing that for every integer k, there exists a graph G with α(G) ≤ 2 and n 0(G) k. In addition, we prove that for every integer k, there exists a graph G with (G) ≤ 3 and n 0(G) k. Both results rely on a new observation: if the complement of G contains a good spectral expander, then n≥ 0(G) must be large. We also show that (G) can be exponentially larger than n 0(G), improving a recent result of Ihringer.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.