拟阵的可去圈

Removable Circuits in Matroid

该文首先用拟阵语言将图论的新概念定义成了拟阵的新概念,然后用拟阵语言将Goddyn和Heuevl所得的图论上的新结果平移成了拟阵的新结果,最后用拟阵的方法对它们给出了新的证明.

This article first uses the matroid language to difine the new concepts of graph as the new concepts of matroid, and then we use the matroid language to translate the new results which Goddyn and Heuvel have attained in graph into the new results of matroid. Last, we will prove these new results by the method of matroid.