betaFeedback

WorksMathematics

The Sparse-Complement Conjecture for Two Distinct Eigenvalues

Abstract

For a graph GG, let q(G)q(G) be the minimum number of distinct eigenvalues of a real symmetric matrix whose off-diagonal zero–nonzero pattern is GG. We prove that q(G)=2q(G)=2 whenever the complement H=G‾H=\overline G of a graph of order n≥3n\ge3 has at most n−3n-3 edges, resolving the sparse-complement conjecture of Fallat and Mojallal. If HH contains a cycle, the proof constructs a nontrivial orthogonal projector with the strong spectral property and rank at most ∣E(F)∣−∣V(F)∣+4|E(F)|-|V(F)|+4, where FF is the union of the cyclic components of HH. The construction combines faithful stress-free Gram representations, a one-coordinate lift for each excess core edge, exact orthogonal-frame completion, and a Stiefel-manifold pendant-extension argument.

Paper details

vlnc:W_55f8aczd
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC-BY-NC-ND-4.0
  • Mathematics

Generative AI tools

View statement
Looking for related papers…