The gonality sequence of complete graphs

Abstract

The gonality sequence (γr)r≥1 of a finite graph / metric graph / algebraic curve comprises the minimal degrees γr of linear systems of rank r. For the complete graph Kd, we show that γr = kd - h if r<g=(d-1)(d-2)2, where k and h are the uniquely determined integers such that r = k(k+3)2 - h with 1≤ k≤ d-3 and 0 ≤ h ≤ k . This shows that the graph Kd has the gonality sequence of a smooth plane curve of degree d. The same result holds for the corresponding metric graphs.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…