39 citations · 73 across the 20 of their papers we have counts for
3 papers · 2 filters
Uniform scrambles on graphs
Lisa Cenek, Lizzie Ferguson, Eyobel Gebre +5
A scramble on a connected multigraph is a collection of connected subgraphs that generalizes the notion of a bramble. The maximum order of a scramble, called the scramble number of…
Multiplicity-Free Gonality on Graphs
Frances Dean, Max Everett, Ralph Morrison
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 consi…
On the scramble number of graphs
Marino Echavarria, Max Everett, Robin Huang +3
The scramble number of a graph is an invariant recently developed to aid in the study of divisorial gonality. In this paper we prove that scramble number is NP-hard to compute, als…