English

The gonality sequence of complete graphs

Combinatorics 2017-03-08 v2 Algebraic Geometry

Abstract

The gonality sequence (γr)r1(\gamma_r)_{r\geq1} of a finite graph / metric graph / algebraic curve comprises the minimal degrees γr\gamma_r of linear systems of rank rr. For the complete graph KdK_d, we show that γr=kdh\gamma_r = kd - h if r<g=(d1)(d2)2r<g=\frac{(d-1)(d-2)}{2}, where kk and hh are the uniquely determined integers such that r=k(k+3)2hr = \frac{k(k+3)}{2} - h with 1kd31\leq k\leq d-3 and 0hk0 \leq h \leq k . This shows that the graph KdK_d has the gonality sequence of a smooth plane curve of degree dd. The same result holds for the corresponding metric graphs.

Keywords

Cite

@article{arxiv.1605.03749,
  title  = {The gonality sequence of complete graphs},
  author = {Filip Cools and Marta Panizzut},
  journal= {arXiv preprint arXiv:1605.03749},
  year   = {2017}
}
R2 v1 2026-06-22T13:59:15.820Z