2022/09/03 by Lisa Cenek, Lizzie Ferguson, Cenek, Lisa +15
Computer Science · #05C57 #14T05 #Algebraic Geometry (math.AG) #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2209.01459
openalex publication_date 2022/09/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The scramble number of a graph is an invariant recently developed to study chip-firing games and divisorial gonality. In this paper we introduce the screewidth of a graph, based on a variation of the existing literature on tree-cut decompositions. We prove that this invariant serves as an upper bound on scramble number, though they are not always equal. We study properties of screewidth, and present results and conjectures on its connection to divisorial gonality.