1 paper
Axel Werner, Ronald F. Wotzlaw
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact value…