Zheng Handing;Liu Guizhen
Journal of Systems Science and Complexity. 1988, 1(2): 104-108.
Let G be the base graph with n vertices of any matroid. It is proved that for any two vertices of G there are at least r internally disjoint shortest paths joining them where r is their distance. Furthermore, for any integer k, r≤k≤n-1, there is a path of length k or k+1 in G joining them. If M is a simple matroid and P=bb_1…b_(r-1)b′is a shortest path in the base graph G of M, then for any integer k, r≤k≤n-1, there is a path of length k between b and b′containing b_1,…,b_(r-1). Therefore the results in [5] are generalized.