Flow-capacity conjecture for directed hypercube separation distance
Flow-capacity conjecture for directed hypercube separation distance
Let be a source set in the directed hypercube with separation distance . Consider a flow network with unit edge capacities and vertex capacities . Flow-capacity conjecture. The maxflow is at least
This would relate edge-capacitated and vertex-capacitated flows in the directed hypercube and is motivated by seeking a flow-based proof of the KMS theorem; the source gives no resolution of the conjecture.
Sources & referencesView supporting material
Primary source
Deeparnab Chakrabarty and C. Seshadhri, “Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing”, arXiv:2409.02206 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.