arXiv (All)
open access
Nearly Spanning Regular Subgraphs
Alon and Mubayi asked whether, for every integer $k\ge1$ and every $\varepsilon>0$, there exists $r_0=r_0(k,\varepsilon)$ such that every $r$-regular graph on $n$ vertices with $r\ge r_0$ contains a $k$-regular subgraph covering at least $(1-\varepsilon)n$ vertices. Previously, the conjecture was kn
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
- Compactness of abundance in asymmetric hypergraph removal lemmas#800112
- Ramsey properties of maximal (outer)planar graphs#972204
- Generalized regular Turán numbers#785030
- Generalized regular Turán numbers#783440
- Extremal graphs with prescribed covering number#490228
Record · ID 1014363
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