Saved in:
Bibliographic Details
Main Authors: Dropuljić, Šimun, Len, Yoav
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2511.19138
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917101022740480
author Dropuljić, Šimun
Len, Yoav
author_facet Dropuljić, Šimun
Len, Yoav
contents We address a question posed by Fessler-Jensen-Kelsey-Owen regarding graphs whose second gonality is greater than the first by exactly 1. We answer the question affirmatively under a stronger condition, thereby characterising the entire gonality sequence for a large family of graphs. We prove a structure theorem for the graphs satisfying the condition, and show that they are all obtained via an inductive process by gluing together complete and banana graphs under certain rules.
format Preprint
id arxiv_https___arxiv_org_abs_2511_19138
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On gonality-tight graphs
Dropuljić, Šimun
Len, Yoav
Combinatorics
Algebraic Geometry
14H51, 05C57, 14T15
We address a question posed by Fessler-Jensen-Kelsey-Owen regarding graphs whose second gonality is greater than the first by exactly 1. We answer the question affirmatively under a stronger condition, thereby characterising the entire gonality sequence for a large family of graphs. We prove a structure theorem for the graphs satisfying the condition, and show that they are all obtained via an inductive process by gluing together complete and banana graphs under certain rules.
title On gonality-tight graphs
topic Combinatorics
Algebraic Geometry
14H51, 05C57, 14T15
url https://arxiv.org/abs/2511.19138