arXiv (All)
open access
The Multiple Unicast Conjecture is False
The undirected multiple-unicast conjecture [LL04] asserts that network coding offers no throughput advantage over multicommodity flow. We refute this conjecture by constructing a deterministic linear network code over $\mathbb{F}_9$ on a 182-vertex bipartite subgraph of the point-line incidence grap
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
- Distinguishing adjacent vertices by ordering edges#999514
- Longest cycles intersect linearly in highly connected graphs#1034521
- On the Brouwer-type Conjecture for Signless Laplacian Eigenvalues of Graphs#1106054
- Efficient construction of subspace design codes over constant alphabet#1354380
- Bounds on Codes Correcting Adjacent Transpositions#609817
Record · ID 1234475
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