[Paper Review] Escaping from the corner of a grid by edge disjoint paths

Adam S. Jobson, André E. Kézdy+1 more|arXiv (Cornell University)|Aug 17, 2017

Algorithms and Data Compression5 references3 citations

TL;DR

This paper establishes escaping lemmas for edge-disjoint path linkage in a 3×3 grid subgraph of the integer lattice, proving that when five to eight terminal pairs are located in the corner, the unpaired terminals can be routed via edge-disjoint paths to distinct boundary vertices on the union of the bottom row and rightmost column. The key contribution is enabling the proof that the Cartesian product of two one-way infinite paths has path-pairability number four.

ABSTRACT

Let $Q$ be a finite subgraph of the integer grid $G$ in the plane, and let $T$ be a set of pairs of distinct vertices in $G$, called `terminal pairs'. Escaping a subset $X\subset T\cap Q$ from $Q$ means finding edge disjoint paths from the terminals in $X$ into distinct vertices of a set $L$ in the boundary of $Q$. Here we prove several lemmas for the cases where $Q$ is a $3 imes 3$ grid, $L$ is the union of a vertical and horizontal boundary line of $Q$, furthermore, $T$ is a set of four terminal pairs in $G$ such that $|T\cap Q|\geq 5$. These lemmas are applied in [4] and complete the proof that the Cartesian product of two (one way) infinite paths has path-pairability number four.

Motivation & Objective

• To resolve the path-pairability of the Cartesian product of two one-way infinite paths, which requires handling terminal pairings when five or more terminals lie in a 3×3 grid corner.
• To establish sufficient conditions under which unpaired terminals in a 3×3 grid subgraph can escape to distinct boundary vertices via edge-disjoint paths.
• To provide constructive lemmas for routing terminals from the grid corner to the boundary using frame-based linkages, clips, and vertex shifting operations.
• To complete the proof of path-pairability number four for the positive integer quadrant in the plane by resolving extremal cases involving dense terminal clusters in the corner.

Proposed method

• Leverages the weak 2-linkage property of the 3×3 grid and its subgraphs (e.g., Q minus (3,3)) to ensure existence of edge-disjoint paths for two terminal pairs.
• Introduces the concept of a 'frame' — a cycle with two edge-disjoint paths to a common vertex — to facilitate linkage of two terminal pairs using external mating paths.
• Employs 'clips' (AA-clips and AB-clips) as subgraphs that contain edge-disjoint paths from terminals to designated boundary vertices, enabling systematic escape routing.
• Uses vertex shifting along the boundary line L = A ∪ B to reposition terminals and free up space for escape paths, especially when boundary vertices are occupied.
• Applies case analysis based on the number of unpaired terminals in the grid corner (from 2 to 4) and their location relative to the boundary and each other.
• Combines path-linkage techniques with structural graph decomposition to ensure edge-disjointness and avoid conflicts in escape path construction.

Experimental results

Research questions

• RQ1 Can four terminal pairs be linked via edge-disjoint paths when five or more terminals are located in a 3×3 grid corner of the integer lattice?
• RQ2 Under what conditions can unpaired terminals in a 3×3 grid subgraph be routed to distinct boundary vertices on the union of the bottom row and rightmost column via edge-disjoint paths?
• RQ3 How can frame-based and clip-based constructions be used to systematically route terminals from the grid interior to the boundary while preserving edge-disjointness?
• RQ4 What role does vertex shifting along the boundary play in resolving conflicts when boundary vertices are occupied by unpaired terminals?
• RQ5 How do structural properties like weak 2-linkage and subgraph connectivity enable the construction of escape paths in extremal configurations?

Key findings

• For any configuration with 5 to 8 terminals in the 3×3 grid corner, the paper proves that unpaired terminals can be routed via edge-disjoint escape paths to distinct boundary vertices on the union of the bottom row and rightmost column.
• The existence of edge-disjoint paths for terminal pairs is guaranteed when the 3×3 grid or its subgraph Q−(3,3) is weakly 2-linked, ensuring linkage for two pairs within the subgraph.
• AA-clips and AB-clips are constructed to provide edge-disjoint mating paths from terminals to designated boundary vertices, enabling systematic escape routing.
• Vertex shifting along the boundary line L allows repositioning of terminals to free up boundary vertices, resolving conflicts when multiple terminals are located on the vertical boundary segment B\A.
• In all cases with 2 to 4 unpaired terminals in the corner, the paper constructs explicit escape paths using frames, clips, and shifting, ensuring no edge overlaps.
• The lemmas collectively complete the proof that the Cartesian product of two one-way infinite paths has path-pairability number four, resolving a key extremal case in the linkage problem.