加载中…
We prove that a biased graph is gainable over the group if and only if it contains no minor isomorphic to , , or . We develop a theory of “partial groups” that is analogous to that of partial fields, and we use this theory to show that a biased graph is gainable over every non-trivial group if and only if it is gainable over and . From this we derive an independent proof of the theorem due to Gerards that a biased graph is gainable over every non-trivial group if and only if it has no minor isomorphic to , , or .

生成讲解博客的中文版本

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