arXiv (OAI Expanded)
open access
A sharp higher-order Cheeger inequality
Let $λ_k(G)$ be the $k$th eigenvalue of the normalized Laplacian of a finite undirected weighted graph $G$ with positive degrees, where $k$ is an integer satisfying $1\le k\le |V(G)|$. Let $φ_k(G)$ be the minimum possible maximum conductance of $k$ disjoint nonempty vertex sets. We prove $φ_k(G)\le
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 50-Vertex Cubic Counterexample to the Domination-versus-Edge-Domination Conjecture#997773
- Functional and geometric inequalities#1345683
- Rigorous foundations of the effective mass approximation: analyticity and symmetry of band extrema#618050
- Rigorous foundations of the effective mass approximation: analyticity and symmetry of band extrema#617550
- Sharp zero forcing numbers for the generalized Petersen graphs $P(n,3)$ and $P(n,4)$#1388625
Record · ID 1381373
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