arXiv (OAI Expanded)
open access
Large Complete Minors from a Cheeger Condition
Let $G$ be a graph on $n$ vertices, and let $e_G(S,V(G)\setminus S)$ be the number of edges with exactly one endpoint in $S$. The Cheeger constant and the restricted Cheeger constant of $G$, where $k\ge1$ is real, are, respectively, \[ h(G)=\min_{\substack{\emptyset\ne S\subseteq V(G)\\|S|\le \fra
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
- Incidence Rank and Bounded Defect for Linear Hypergraphs with Cograph Line Graphs#1064321
- New bounds on the Graham-Pollak theorem for hypergraphs#1084293
- Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes#1158241
- Vector Balancing via Directional Total Variation#998738
- A sharp Santaló inequality in a slab with centrally symmetric sections#1142341
Record · ID 1109429
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