Exponents of Jacobians of graphs and regular matroids

From MaRDI portal



Abstract: Let G be a finite undirected multigraph with no self-loops. The Jacobian operatornameJac(G) is a finite abelian group associated with G whose cardinality is equal to the number of spanning trees of G. There are only a finite number of biconnected graphs G such that the exponent of operatornameJac(G) equals 2 or 3. The definition of a Jacobian can also be extended to regular matroids as a generalization of graphs. We prove that there are finitely many connected regular matroids M such that operatornameJac(M) has exponent 2 and characterize all such matroids.












This page was built for publication: Exponents of Jacobians of graphs and regular matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965493)