We define a new graph invariant called the scramble number. show that number of is lower bound for gonality and an upper treewidth. Unlike treewidth, not minor monotone, but it subgraph monotone under subdivision. compute several families graphs which these invariants are strictly greater than