Pith. sign in

REVIEW 3 minor 32 references

The excluded minors for $\mathsf{Z}_{3}$-gainable and regular biased graphs

T0 review · 0 major / 3 minor · reviewed 2026-06-26 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A biased graph is gainable over Z3 if and only if it contains none of three specific forbidden minors.

desk verdict The paper gives a clean Z3-gainability forbidden-minor list and uses a new partial-groups theory to reduce general gainability to the Z2/Z3 cases, plus an independent Gerards proof. read the letter →

arxiv 2606.23826 v1 pith:WVKP2H32 submitted 2026-06-22 math.CO

Nick Brettell , Rutger Campbell , Daryl Funk , Dillon Mayhew This is my paper · ORCID
classification math.CO
keywords biasedgraphsgainableexcludedminorspartialgroupsZ3regularGerardstheorem
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proves that biased graphs which can be assigned gains from the cyclic group of order three are precisely those without minors isomorphic to (4K2 with no bias), plus-or-minus K3, or minus K4. It introduces a theory of partial groups, modeled on partial fields, to track the algebraic compatibility of gains across different groups. This theory shows that a biased graph admits gains from every nontrivial group if and only if it admits gains from both Z2 and Z3. The reduction supplies an independent derivation of the earlier excluded-minor list for regular biased graphs. The characterizations matter because they give explicit, checkable obstructions for these gainability properties.

What carries the argument

The theory of partial groups, which encodes compatibility conditions for gains from multiple groups and reduces the general gainability question to the cases of Z2 and Z3.

What would settle it

A concrete biased graph that contains one of the three Z3-forbidden minors yet still admits a valid Z3-gain assignment, or a graph free of those minors that admits no such assignment.

Watch

Extended reading notes

Core claim

A biased graph is gainable over Z3 if and only if it contains no minor isomorphic to (4K2, ∅), ±K3, or -K4. The partial-groups theory then yields that gainability over every nontrivial group holds exactly when the graph is gainable over both Z2 and Z3; this in turn implies the graph has no minor isomorphic to (3K2, ∅), ±K3, or -K4.

Load-bearing premise

The theory of partial groups correctly encodes the algebraic conditions needed for a biased graph to receive consistent gains from an arbitrary group.

Editorial extensions

If this is right

  • Gainability over Z3 is decided exactly by the absence of the three listed minors.
  • Gainability over every nontrivial group is decided by separate checks against Z2 and Z3.
  • Regular biased graphs are exactly those without minors (3K2, ∅), ±K3, or -K4.
  • The Z3 characterization stands on its own and does not rely on the regular case.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The partial-groups device may extend to give similar characterizations for gainability over other small cyclic groups.
  • The two separate minor lists separate the even-order and odd-order cases in the study of biased graphs.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The paper proves that a biased graph is gainable over Z3 if and only if it has no minor isomorphic to (4K2, ∅), ±K3, or -K4. It develops a theory of partial groups (analogous to partial fields) and uses it to prove that a biased graph is gainable over every non-trivial group if and only if it is gainable over Z2 and Z3. This yields an independent proof of Gerards' theorem characterizing regular biased graphs by the excluded minors (3K2, ∅), ±K3, and -K4.

Significance. If the results hold, the work supplies clean excluded-minor characterizations and introduces partial groups as a new algebraic tool for gainability questions. The reduction to the Z2/Z3 cases and the independent proof of Gerards' theorem are notable strengths; the framework may extend to other representation problems in biased graphs and matroids.

minor comments (3)
  1. The definition and axioms for partial groups (introduced to support the reduction) would benefit from an explicit comparison table to the axioms of partial fields to highlight the analogy.
  2. Notation for the pair (G, B) representing a biased graph and for the gain function could be introduced with a short example in the preliminaries to aid readers unfamiliar with the area.
  3. The case analysis establishing the three forbidden minors for Z3-gainability should include a brief remark on why no other small biased graphs arise as minimal obstructions.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the paper, the recognition of the excluded-minor characterizations, the introduction of partial groups, and the independent proof of Gerards' theorem. The recommendation for minor revision is noted. No specific major comments appear in the report.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; derivation self-contained

full rationale

The paper develops the partial-groups axioms and representation theory explicitly within the manuscript, proves the relevant minor-closed properties and reduction from arbitrary groups to the Z2/Z3 cases using those axioms, and performs direct case analysis to obtain the excluded-minor lists for Z3-gainability and the Gerards reproof. No step reduces a claimed result to a fitted parameter, a self-citation chain, or a definitional renaming; the central characterizations rest on the newly constructed algebraic framework and standard minor theory applied to the listed forbidden minors.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The central claims rest on the standard axioms of group theory and graph-minor theory together with the newly introduced partial-groups framework; no free parameters or data-fitting steps appear.

assumptions (1)
  • standard math Standard axioms of groups, biased graphs, and minor-closed families
    Invoked throughout the statements of the theorems in the abstract.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The excluded minors for $\mathsf{Z}_{3}$-gainable and regular biased graphs." pith.science (2026). https://pith.science/paper/WVKP2H32

@misc{pith2026260623826,
  author       = {Pith},
  title        = {Pith review of: The excluded minors for $\mathsfZ_3$-gainable and regular biased graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WVKP2H32}},
  note         = {Machine review of arXiv:2606.23826}
}
abstract

We prove that a biased graph is gainable over the group $\mathsf{Z}_{3}$ if and only if it contains no minor isomorphic to $(4K_{2},\emptyset)$, $\pm K_{3}$, or $-K_{4}$. 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 $\mathsf{Z}_{2}$ and $\mathsf{Z}_{3}$. 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 $(3K_{2},\emptyset)$, $\pm K_{3}$, or $-K_{4}$.

Figures

Figures reproduced from arXiv: 2606.23826 by the authors.

Figure 1
Figure 1. The excluded minors for Z3-gainable biased graphs, where a cycle is balanced if and only if it contains an even number of edges of each (non-black) colour. Rota famously conjectured that when F is a finite field, the class of F-rep￾resentable matroids has only finitely many excluded minors [23]. We con￾jecture that when Γ is a finite group, the class of Γ-gainable biased graphs [PITH_FULL_IMAGE:figures/full_fig_p00… view at source ↗
Figure 2
Figure 2. A labelling of the vertices and edges in K4. γ(d, 2, 3) = γ(f, 1, 3) = α. It is not difficult to check that the only cycles in Bγ have the edge sets {a, c, e} and {a, d, f}, so γ is a gaining of ±K3\b, as desired. Next we consider contracting the edge a. Let w be the vertex obtained via identifying 1 and 2. Let γ be the gaining where c and e are taken to 1Γ and where γ(b, w, w) = γ(d, 3, w) = γ(f, 3, w) = α. The onl… view at source ↗
Figure 3
Figure 3. The biased graph Ω. The solid lines are the edges in the set X. Let X = {e, f, g′}. We will show that a Hamiltonian cycle is balanced if and only if it contains an even number of edges in X. This will show that Ω is isomorphic to ±K3, a contradiction. The cycle which contains zero edges of X is {e ′ , f′ , g}, and Claim 5.1.4 implies that this cycle is balanced, because it is a cycle of Ω\{e, f} that contains g. Ass… view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: The biased graph Ω. The cycle D is marked in bold lines. The horizontal edges belong to the path P. Dashed lines indicate paths of unspecified length and solid lines indicate edges. The only non-trivial parallel class of Ω\{e, f} is the one containing g. Now we know th…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

32 extracted references

  1. [1]

    Arnborg, A

    S. Arnborg, A. Proskurowski, and D. G. Corneil. Forbidden minors characterization of partial 3-trees.Discrete Math.80 (1):1–19, 1990.↑1

    1990

  2. [2]

    R. E. Bixby. On Reid’s characterization of the ternary matroids.J. Combin. Theory Ser. B26 (2):174–204, 1979.↑1

    1979

  3. [3]

    Bowler, D

    N. Bowler, D. Funk, and D. Slilaty. Describing quasi-graphic matroids.European J. Combin.85:103062, 26, 2020.↑3

    2020

  4. [4]

    Brettell, J

    N. Brettell, J. Oxley, C. Semple, and G. Whittle. The excluded minors for 2- and 3-regular matroids.J. Combin. Theory Ser. B163:133–218, 2023.↑1

    2023

  5. [5]

    Chartrand and F

    G. Chartrand and F. Harary. Planar permutation graphs.Ann. Inst. H. Poincar´ e Sect. B (N.S.)3:433–438, 1967.↑1

    1967

  6. [6]

    Chen and J

    R. Chen and J. Geelen. Infinitely many excluded minors for frame matroids and for lifted-graphic matroids.J. Combin. Theory Ser. B133:46–53, 2018.↑4

    2018

  7. [7]

    Diestel.Graph theory

    R. Diestel.Graph theory. Graduate Texts in Mathematics, vol. 173. Springer-Verlag, Berlin, 3rd ed., 2005.↑

    2005

  8. [8]

    G. A. Dirac. Minimally 2-connected graphs.J. Reine Angew. Math.228:204–216, 1967.↑6

    1967

Show all 32 references
  1. [9]

    Funk,On excluded minors and biased graph representations of frame matroids

    D. Funk,On excluded minors and biased graph representations of frame matroids. PhD thesis. Simon Fraser University, 2015.↑2, 3, 4 EXCLUDED MINORS FOR BIASED GRAPHS 39

    2015

  2. [10]

    D. Funk, D. Mayhew, and M. Newman. Defining bicircular matroids in monadic logic. Q. J. Math.73 (1):65–92, 2022.↑4

    2022

  3. [11]

    Matrix representations of frame and lifted-graphic matroids correspond to gain functions.J

    Daryl Funk, Irene Pivotto, and Daniel Slilaty. Matrix representations of frame and lifted-graphic matroids correspond to gain functions.J. Comb. Theory Ser. B155 (C):202–255, 2022.↑4

    2022

  4. [12]

    J. F. Geelen, A. M. H. Gerards, and A. Kapoor. The excluded minors for GF(4)- representable matroids.J. Combin. Theory Ser. B79 (2):247–299, 2000.↑1, 17

    2000

  5. [13]

    Structure in minor-closed classes of ma- troids

    Jim Geelen, Bert Gerards, and Geoff Whittle. Structure in minor-closed classes of ma- troids. Surveys in combinatorics 2013. London Math. Soc. Lecture Note Ser., vol. 409. Cambridge Univ. Press, Cambridge., pages 327–362. 2013.↑3

    2013

  6. [14]

    Geelen, B

    J. Geelen, B. Gerards, and G. Whittle. Quasi-graphic matroids.J. Graph Theory87 (2):253–264, 2018.↑3

    2018

  7. [15]

    A. M. H. Gerards. A short proof of Tutte’s characterization of totally unimodular matrices.Linear Algebra Appl.114/115:207–212, 1989.↑1, 17

    1989

  8. [16]

    Binary spaces and cutting planes

    Graphs and polyhedra. Binary spaces and cutting planes. CWI Tract, vol. 73. Stichting Mathematisch Centrum, Centrum voor Wiskunde en Informatica, Amster- dam, 1990.↑3

    1990

  9. [17]

    R. Hall, D. Mayhew, and S. H. M. van Zwam. The excluded minors for near-regular matroids.European J. Combin.32 (6):802–830, 2011.↑1

    2011

  10. [18]

    W. Mader. Connectivity and edge-connectivity in finite graphs. In Surveys in combi- natorics (Proc. Seventh British Combinatorial Conf., Cambridge, 1979), pages 66–95. 1979.↑6

    1979

  11. [19]

    N. A. Neudauer and D. Slilaty. Bounding and stabilizing realizations of biased graphs with a fixed group.J. Combin. Theory Ser. B122:149–166, 2017.↑13

    2017

  12. [20]

    R. A. Pendavingh and S. H. M. van Zwam. Confinement of matroid representations to subsets of partial fields.J. Combin. Theory Ser. B100 (6):510–545, 2010.↑3, 31

    2010

  13. [21]

    Lifts of matroid representations over partial fields.J. Combin. Theory Ser. B100 (1):36–67, 2010.↑3, 31, 35

    2010

  14. [22]

    Robertson, P

    N. Robertson, P. Seymour, and R. Thomas. Sachs’ linkless embedding conjecture.J. Combin. Theory Ser. B64 (2):185–227, 1995.↑1

    1995

  15. [23]

    G.-C. Rota. Combinatorial theory, old and new. Actes du Congr` es International des Math´ ematiciens (Nice, 1970). Gauthier-Villars, Paris., pages 229–233. 1971.↑2

    1970

  16. [24]

    Satyanarayana and L

    A. Satyanarayana and L. Tung. A characterization of partial 3-trees.Networks20 (3):299–322, 1990.↑1

    1990

  17. [25]

    Semple and G

    C. Semple and G. Whittle. Partial fields and matroid representation.Adv. in Appl. Math.17 (2):184–208, 1996.↑3, 31

    1996

  18. [26]

    P. D. Seymour. Matroid representation over GF(3).J. Combin. Theory Ser. B26 (2):159–173, 1979.↑1

    1979

  19. [27]

    W. T. Tutte. A homotopy theorem for matroids. I, II.Trans. Amer. Math. Soc. 88:144–174, 1958.↑1

    1958

  20. [28]

    Mathematical Expositions, vol

    Connectivity in graphs. Mathematical Expositions, vol. No. 15. University of Toronto Press, Toronto, ON; Oxford University Press, London, 1966.↑6

    1966

  21. [29]

    K. Wagner. ¨Uber eine Eigenschaft der ebenen Komplexe.Math. Ann.114 (1):570–590, 1937.↑1

    1937

  22. [30]

    Zaslavsky

    T. Zaslavsky. Characterizations of signed graphs.J. Graph Theory5 (4):401–406, 1981.↑2

    1981

  23. [31]

    Biased graphs. I. Bias, balance, and gains.J. Combin. Theory Ser. B47 (1):32–52, 1989.↑1, 2, 8

    1989

  24. [32]

    Biased graphs. IV. Geometrical realizations.J. Combin. Theory Ser. B89 (2):231–297, 2003.↑4

    2003

Pith tools

Reviewed June 26, 2026 · model on record in the stance chip above.