arXiv (All)
open access
Are trees really just butterflies in disguise?
As a generalisation of the Erdős-Sós conjecture about graphs, Addario-Berry, Havet, Linhares Sales, Reed and Thomassé conjectured that every digraph on $n$ vertices with more than $(k-1)n$ arcs contains every antidirected tree with $k$ arcs. We prove a dense, approximate version of this for trees wi
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
- Erdős-Sós via random cyclic orderings#1035127
- Faster Minimum k-Cut II: Near-Optimal and Deterministic for Weighted Graphs#1064341
- Polynomial positivity cones for Coxeter roots and walks in trees#998859
- An $O(k\log(n/k))$ Bound on Spanning Bipartite Connectivity#1049006
- Convergence and compactness of discrete aggregation trees#1070568
Record · ID 987934
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