Every graph of maximum degree d admits a signing σ with ρ(A_σ) ≤ 2√(3(d-1)).
Bownik,Selector form of Weaver’s conjecture and frame sparsification, arXiv preprint arXiv:2405.18235, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
An Improved Upper Bound for the Bilu-Linial Conjecture via Interlacing Families
Every graph of maximum degree d admits a signing σ with ρ(A_σ) ≤ 2√(3(d-1)).