加载中…
In 1981 Seymour proved his famous 6-flow theorem asserting that every 2-edge-connected graph has a nowhere-zero flow in the group (in fact, he offers two proofs of this result). In this note we give a new short proof of a generalization of this theorem where -valued functions are found subject to certain boundary constraints.

生成讲解博客的中文版本

生成AI智能校验的中文版本