Scramble number and tree-cut decompositions
From MaRDI portal
Publication:6409657
arXiv2209.01459MaRDI QIDQ6409657FDOQ6409657
Authors: Lisa Cenek, Ralph Morrison, Ben Weber 
Publication date: 3 September 2022
Abstract: 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.
This page was built for publication: Scramble number and tree-cut decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409657)
