arXiv (All)
open access
Sharp connectivity thresholds for mixed rigidity packings and improved bounds for highly connected orientations of graphs
Garamvölgyi, Jordán, Király and Villányi [{{\bf Forum Math. Pi} \textbf{13} (2025), Paper No.~e11}] posed two sharp connectivity conjectures for packing rigid spanning subgraphs: one for the equal-dimensional case and the other for the packing of a $d$-rigid spanning subgraph with a spanning tree. W
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
- Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems#451646
- Orientations of $10$-Edge-Connected Planar Multigraphs and Applications#614965
- Orientations of $10$-Edge-Connected Planar Multigraphs and Applications#613998
- On the Hamiltonicity, traceability and toughness of complements of line graphs#1122427
- Homogeneity of profinite graphs#635747
Record · ID 1050638
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