Representability of Graphical Symplectic Matroids

arXiv:2611.01241 · math.CO · Submitted 2026-10-31 · Read on arXiv

math.CO

Submitted: 2026-10-31

Updated: 2026-11-06

License: http://creativecommons.org/licenses/by/4.0/

The gist: Chow associated with every finite multigraph G a symplectic matroid on the signed edge set E E*, whose restrictions to transversals are frame matroids of signed graphs…

Terminology

Abstract

Chow associated with every finite multigraph G a symplectic matroid on the signed edge set E E*, whose restrictions to transversals are frame matroids of signed graphs, and Sarvepalli asked which of these matroids are representable. For a connected graph containing a cycle, we show that every isotropic representation of S(G) admits an incidence-flow normal form. The remaining representation conditions are expressed through its admissible minors. Consequently, if is-representable, then the bridgeless part of G has a nowhere-zero (,+) -flow. In characteristic other than two, is representable if and only if every non-loop edge on a cycle has a parallel mate. In characteristic two, we characterize the loopless graphs without two vertex-disjoint cycles by the existence of a nowhere-zero (,+) -flow, and we show that rigidly linked short cycles, and hence subdivisions of the prism, are obstructions. For 3-connected simple graphs this gives a complete answer: is-representable if and only if has characteristic two, G has no two vertex-disjoint cycles, and either >2 or G K 5. In particular, the matroid of the Petersen graph is representable over no field. Finally, the admissible corank--nullity polynomial of an arbitrary symplectic matroid is intrinsic and satisfies a three-term contraction identity. For graphical symplectic matroids, this becomes a deletion-contraction recursion that closes up once marked vertices are allowed, and polynomials built from enveloping matroids agree with it exactly for sheltering envelopes.

Sources

Related papers