English

Gonality of complete graphs with a small number of omitted edges

Algebraic Geometry 2016-02-23 v2 Combinatorics

Abstract

Let KdK_d be the complete metric graph on dd vertices. We compute the gonality of graphs obtained from KdK_d by omitting edges forming a KhK_h, or general configurations of at most d2d-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 d2d-2 edges not forming a K3K_3 using models of plane curves with certain singularities. We also study the gonality when removing d1d-1 edges not forming a K3K_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.

Keywords

Cite

@article{arxiv.1503.01349,
  title  = {Gonality of complete graphs with a small number of omitted edges},
  author = {Marta Panizzut},
  journal= {arXiv preprint arXiv:1503.01349},
  year   = {2016}
}

Comments

30 pages, 8 figures