关于图的回路集和截集

On the Cut Set and Circuit Set of a Graph

本文证明了有向图Ｇ的回路集（或截集）不能表示成Ｇ的彼此不交的回路（或截集）的系数在Ｚ３中的线性组合。得出结果：若Ｓ（Ｃ）为ｍ×ｎ有向连通图Ｇ的所有的回路（截）的集合，则一定有π（Ｓ）（Ｌ）

This paper gives out a negative answer to the question that a circuit (cut) set can be represented by combinations of a set of disconnected cycle (cut) with coeffient in Z 3