Bounds on higher graph gonality
From MaRDI portal
Publication:6402065
arXiv2206.06907MaRDI QIDQ6402065FDOQ6402065
Authors: Lisa Cenek, Ralph Morrison 
Publication date: 14 June 2022
Abstract: We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving independence number, and lower bounds on gonality by scramble number. We apply our bounds to study the computational complexity of computing higher gonalities, proving that it is NP-hard to compute the second gonality of a graph when restricting to multiplicity-free divisors.
This page was built for publication: Bounds on higher graph gonality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402065)
