The excluded minors for -gainable and regular biased graphs
arXiv:2606.23826
Abstract
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 .
39 pages, 4 figures