arXiv (All)
open access
Lower bounds for the magnitude of the minimum eigenvalue of graphs with applications to MaxCut and Chowla's cosine problem
Jin, Milojević, Tomon and Zhang established a powerful recursive estimate relating the positive eigenvalues of a graph whose least eigenvalue is small in absolute value. We establish a refinement of this result, yielding improved estimates across spectral graph theory and discrepancy theory, and for
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quadratic inequalities between the largest eigenvalues of a graph#1142282
- A structure theory for signed graphs with fixed smallest eigenvalue#677502
- A structure theory for signed graphs with fixed smallest eigenvalue#674304
- Maximum packing for perfect four-triple configurations#955115
- A Statistical Analysis of Diffusion Dynamics in Networks#1062684
Record · ID 1156928
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive