A New Lower Bound on Graph Gonality

Michael Harp, Elijah Jackson, David Jensen +1

We define a new graph invariant called the scramble number. We show that the scramble number of a graph is a lower bound for the gonality and an upper bound for the treewidth. Unli…