Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
C. Seshadhri · 23:38
The talk gives a new combinatorial proof of the Lehman–Ron theorem (ordered bijections between hypercube level sets yield vertex-disjoint paths), strengthens it to two edge-disjoint path systems when the sets are at l...