arXiv (All)
open access
Rooted Spider Embeddings and the Erd\H os-Sós Conjecture
Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof
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 Nine-Element Minor Theorem for 3-Connected Nonbinary Matroids with a W4-Minor#1065631
- On a conjecture concerning antipodal labelings for cycles#1077406
- Matroids and isomorphism problems for Bestvina-Brady groups#1110708
- Linear circumference in vertex-transitive graphs#1157401
- Meta-analysis of urbanization effects on spider diversity#780701
Record · ID 1051925
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