arXiv:2106.12568 [math.CO]AbstractReferencesReviewsResources
Discrete and metric divisorial gonality can be different
Josse van Dobben de Bruyn, Harry Smit, Marieke van der Wegen
Published 2021-06-23Version 1
This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal divisorial gonality of all regular subdivisions of $G$, and we provide a class of graphs for which this number is strictly smaller than the divisorial gonality of $G$. This settles a conjecture of M. Baker in the negative.
Comments: 14 pages, 4 figures
Related articles: Most relevant | Search more
arXiv:2011.11910 [math.CO] (Published 2020-11-24)
Poincaré Series of Divisors on Graphs and Chains of Loops
arXiv:1103.5517 [math.CO] (Published 2011-03-29)
Weak Convergence of Laws of Finite Graphs
arXiv:2208.03573 [math.CO] (Published 2022-08-06)
Computing higher graph gonality is hard