arXiv (All)
open access
Strongly separating graph edges with $10n$ paths
A family of paths strongly separates the edges of a graph if every two distinct edges are separated in both directions by paths in the family. Bonamy, Botler, Dross, Naia, and Skokan proved that every $n$-vertex graph admits such a family of at most $19n$ paths. We improve this bound to $10n-o(n)$.
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-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting#1077253
- Bounded Independence Edge Subsampling in Graphs#347579
- Sparsification Framework for Directed Densest Subgraph#1155781
- Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets#684150
- Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets#682375
Record · ID 986607
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