arXiv (All)
open access
Small subgraphs of large minimum degree
In 1991, Erdős, Faudree, Rousseau and Schelp asked to estimate the smallest $u=u(n,d,s)$ such that every $n$-vertex graph with average degree at least $d$ has a subgraph on at most $u$ vertices with minimum degree at least $s$. We resolve this problem up to polylogarithmic factors for all even value
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 Sublinear Minimum-Degree Condition for $2$-Connected Subgraphs of All Orders#793866
- A Sublinear Minimum-Degree Condition for $2$-Connected Subgraphs of All Orders#789847
- An Optimal Bound for Ramsey Goodness of Cycles#799017
- An Optimal Bound for Ramsey Goodness of Cycles#797602
- Sidorenko‐Type Inequalities for Pairs of Trees#628827
Record · ID 1402014
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