Multiplicity-Free Gonality on Graphs
Multiplicity-Free Gonality on Graphs
The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph.We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most 1 chip on each vertex.We give a sufficient condition in terms of vertex-connectivity for these …