证明了如果M=(E,B)是一个简单拟阵,拟阵M的秩ρ=ρ(M)至少为2,E中的每一个元素都包含在M的某一个圈中,△(M)=△(E,B,F)为拟阵M的基关联图,则△(M)中存在一条路P,使得P覆盖E中的所有元素.
It is proved that if M= (E, B) is a simple matroid, the rank of Mρ = ρ(M) is at least 2, every element of E is contained in at least one circuit, △( M)is the base incidence graph of matroid M, then there exists a path P in △(M), such that the vertices of P cover all vertices of E.