Generalized Lehman–Ron conjecture for directed hypercube layers
Generalized Lehman–Ron conjecture for directed hypercube layers
Let ) and be layers of the directed hypercube, with and . Let be a matched pair with and . Generalized Lehman–Ron conjecture. There are collections of vertex-disjoint paths between and such that their union is edge-disjoint. As the separation between the layers increases, the conjecture predicts proportionally more collections of paths; the paper states that its techniques do not resolve this claim.
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.