arXiv (All)
open access
On Eigenvalue Bounds for Bounded Genus Graphs and Minor-Free Graphs
In this paper, we resolve a 30-year-old conjecture of Spielman and Teng concerning the performance of the spectral partitioning method on graphs embeddable on an orientable surface of genus $g\ge 1$. In particular, for such a graph $G$ with $n$ vertices and maximum degree $Δ$, we show that the secon
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
- A Complete Characterization of Near Outer-Planar Graphs#938987
- The Distance Between the Adjacency Spectral Center and the Characteristic Set of a Tree#1123353
- Frobenius splitting for Fano threefolds#1049377
- Moret-Bailly families and non-liftable schemes#1011926
- On the classification of regular graphs with positive Lin-Lu-Yau curvature#986526
Record · ID 1105150
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