Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 32 tok/s
GPT-5 High 40 tok/s Pro
GPT-4o 83 tok/s
GPT OSS 120B 467 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

Gonality of complete graphs with a small number of omitted edges (1503.01349v2)

Published 4 Mar 2015 in math.AG and math.CO

Abstract: Let $K_d$ be the complete metric graph on $d$ vertices. We compute the gonality of graphs obtained from $K_d$ by omitting edges forming a $K_h$, 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 $K_3$ using models of plane curves with certain singularities. We also study the gonality when removing $d-1$ edges not forming a $K_3$. 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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)