ISSN:
1439-6912
Schlagwort(e):
05 C 40
;
05 C 38
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Abstract A graph with at least 2k vertices is said to bek-linked if, for any choices 1,...,s k ,t 1,...,t k of 2k distinct vertices there are vertex disjoint pathsP 1,...,P k withP i joinings i tot i , 1≤i≤k. Recently Robertson and Seymour [16] showed that a graphG isk-linked provided its vertex connectivityk(G) exceeds $$10k\sqrt {\log _2 k}$$ . We show here thatk(G)≥22k will do.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01261316
Permalink