The excluded minors for Z3-gainable and regular biased graphs

Abstract

We prove that a biased graph is gainable over the group Z3 if and only if it contains no minor isomorphic to (4K2,), K3, or -K4. 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 Z2 and Z3. 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 (3K2,), K3, or -K4.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…