arXiv:1708.03069 [math.CO]AbstractReferencesReviewsResources
Two-vertex generators of Jacobians of graphs
David Brandfonbrener, Pat Devlin, Netanel Friedenberg, Yuxuan Ke, Steffen Marcus, Henry Reichard, Ethan Sciamma
Published 2017-08-10Version 1
We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by Becker and Glass and allows us to prove various other propositions about the order of divisors that are the difference of two vertices. We conclude with some conjectures about these divisors on random graphs and support them with empirical evidence.
Comments: 15 pages
Related articles: Most relevant | Search more
arXiv:math/0306266 [math.CO] (Published 2003-06-18)
The Lovasz number of random graphs
arXiv:1709.00864 [math.CO] (Published 2017-09-04)
The evolution of random graphs on surfaces
arXiv:1901.10734 [math.CO] (Published 2019-01-30)
A note on the relation between two properties of random graphs