Metraipolis › archive › dc_4bc29e6fcf7b
The Sparse-Complement Conjecture for Two Distinct Eigenvalues — arXiv:2611.09111
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09111
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:43:49.265Z
- SHA-256 of the archived text
3774357c4e7ae1c4d20ea9d4b8b25036aab78e3de7c1769ce327e1907a31386e- Stable URL of this page
https://metraipolis.com/documento/dc_4bc29e6fcf7b
How to cite
The Sparse-Complement Conjecture for Two Distinct Eigenvalues — arXiv:2611.09111 — arXiv (en), https://arxiv.org/abs/2611.09111 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4bc29e6fcf7b (Metraipolis archive dc_4bc29e6fcf7b, sha256 3774357c4e7ae1c4d20ea9d4b8b25036aab78e3de7c1769ce327e1907a31386e)
BibTeX
@misc{dc4bc29e6fcf7b,
title = {The Sparse-Complement Conjecture for Two Distinct Eigenvalues — arXiv:2611.09111},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09111},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4bc29e6fcf7b; sha256 3774357c4e7ae1c4d20ea9d4b8b25036aab78e3de7c1769ce327e1907a31386e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09111. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a graph $G$, let $q(G)$ be the minimum number of distinct eigenvalues of a real symmetric matrix whose off-diagonal zero--nonzero pattern is $G$. We prove that $q(G)=2$ whenever the complement $H=\overline G$ of a graph of order $n\ge3$ has at most $n-3$ edges, resolving the sparse-complement conjecture of Fallat and Mojallal. If $H$ contains a cycle, the proof constructs a nontrivial orthogonal projector with the strong spectral property and rank at most $|E(F)|-|V(F)|+4$, where $F$ is the union of the cyclic components of $H$. 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. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.09111 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-09T22:36:32.144Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).