Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs

It is proved that for every positive integers k, r and s there exists an integer n = n(k,r,s) such that every k-connected graph of order at least n contains either an induced path of length s or a subdivision of the complete bipartite graph Kk,r. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 270–274, 2004

[1]  Stephen C. Locke,et al.  Relative lengths of paths and cycles in 3-connected graphs , 1981, Discret. Math..

[2]  Robin Thomas,et al.  Typical Subgraphs of 3- and 4-Connected Graphs , 1993, J. Comb. Theory, Ser. B.

[3]  Bill Jackson,et al.  Longest cycles in 3-connected planar graphs , 1992, J. Comb. Theory, Ser. B.

[4]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[5]  Xingxing Yu,et al.  Convex Programming and Circumference of 3-Connected Graphs of Low Genus , 1997, J. Comb. Theory, Ser. B.