arXiv (OAI Expanded)
open access
Extremal function for rooted $K_5$ minors
We show that if an n-vertex 5-connected graph has at least 4n-10 edges, then for any choice of five of its vertices, we can contract disjoint connected subgraphs containing these vertices to obtain $K_5$ as a minor. The bound on the number of edges is the best possible.
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
- Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank#1033943
- Large induced subgraphs with $k$ vertices of maximum degree#822116
- On two minimax theorems in graph#490182
- The game chromatic number of generalized Mycielski graphs of paths and cycles#924181
- The game chromatic number of generalized Mycielski graphs of paths and cycles#919950
Record · ID 1083314
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