Three Obstructions Characterize Finite Path-Width in Countable Graphs
Structural exclusions yield a finite path-width criterion, while universal-host constructions separate line-width bounds from path-width guarantees.
Sep 5, 20264 min2608.27752
2 articles on SOTA Papers
Structural exclusions yield a finite path-width criterion, while universal-host constructions separate line-width bounds from path-width guarantees.
A minimal-counterexample proof settles Aharoni’s r=2 case and shows the ceiling n/2 bound cannot be improved.
