Computing higher graph gonality is hard

MaRDI QIDQ6407158zbMATH OpenFDO

Authors Ralph Morrison, Lucas Tolley

Publication date 6 August 2022

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Special divisors on curves (gonality, Brill-Noether theory) (14H51)

Abstract: In the theory of divisors on multigraphs, the $r^{th}$ divisorial gonality of a graph is the minimum degree of a rank $r$ divisor on that graph. It was proved by Gijswijt et al. that the first divisorial gonality of a finite graph is NP-hard to compute. We generalize their argument to prove that it is NP-hard to compute the $r^{th}$ divisorial gonality of a finite graph for all $r$. We use this result to prove that it is NP-hard to compute $r^{th}$ stable divisorial gonality for a finite graph, and to compute $r^{th}$ divisorial gonality for a metric graph. We also prove these problems are APX-hard, and we study the NP-completeness of these problems.

This page was built for publication: Computing higher graph gonality is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407158)