arXiv (All)
open access
Connectivity keeping pendant extensions of paths in $k$-connected graphs and triangle-free graphs
Motivated by Mader's conjecture on connectivity keeping trees, we study trees obtained from paths by adding one pendant vertex, as well as related problems in triangle-free graphs. For an integer $m$ and $1\leq i\leq m-1$, let $P_m^+(i)$ denote the tree obtained from a path of order $m-1$ by addin
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 Proof of the Tree Packing Conjecture#821673
- The Erd\H os-Sós conjecture in dense graphs#985287
- Towards a more structured search for Erdős-Gyárfás counter-examples#1076250
- A Note on the Invertibility of Oriented Graphs#628825
- Finite graphs and configurations of points#984065
Record · ID 1049373
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