Li-Li Undirected Multiple-Unicast Network Coding Conjecture

For every finite undirected edge-capacitated network and every finite collection of independent source-destination unicast sessions, prove or disprove that the zero-error network-coding capacity region equals the fractional multicommodity-routing capacity region. Each undirected edge has a shared capacity bounding the sum of transmission rates in its two directions; intermediate nodes may causally encode received messages in the coding model. Fractional routing may split each session over paths. The target uses the standard zero-error formulation, not multicast or directed networks.

Source: Sirui Liu, Li Que, Zongpeng Li and Baochun Li, On the Multiple-Unicast Conjecture: Beyond Cut Metrics, arXiv:2608.06070v1 (2026).

Status Open · subcases solved Status review date not recorded in this edition

Listed by ProofAtlas. Status qualification is attributed to ProofAtlas; no full resolution is certified here.

References

Primary source

ProofAtlas open problems; Sirui Liu, Li Que, Zongpeng Li and Baochun Li, On the Multiple-Unicast Conjecture: Beyond Cut Metrics, arXiv:2608.06070v1 (2026)

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.