"Highly linked graphs" by Béla Bollobás and Andrew Thomason
 

Highly linked graphs

Abstract

A graph with at least 2k vertices is said to be k-linked if, for any choice s1, . . . ,sk, t1, . . . ,tk. of 2k distinct vertices there are vertex disjoint paths P1, . . . ,Pk with Pi joining si to ti, 1≤i≤k. Recently Robertson and Seymour [16] showed that a graph G is k-linked provided its vertex connectivity k(G) exceeds 10k-√log2 k. We show here that k(G)≥22k will do.

Publication Title

Combinatorica

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 86
  • Usage
    • Abstract Views: 6
  • Captures
    • Readers: 6
see details

Share

COinS