Gonality of complete graphs with a small number of omitted edges
Abstract
Let Kd be the complete metric graph on d vertices. We compute the gonality of graphs obtained from Kd by omitting edges forming a Kh, or general configurations of at most d-2 edges. We also investigate if these graphs can be lifted to curves with the same gonality. We lift the former graphs and the ones obtained by removing up to d-2 edges not forming a K3 using models of plane curves with certain singularities. We also study the gonality when removing d-1 edges not forming a K3. We use harmonic morphism to lift these graphs to curves with the same gonality because in this case plane singular models can no be longer used due to a result of Coppens and Kato.
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.