Abstract: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, that we refer to as quasi-banana graphs. We prove a structure theorem for those graphs, and show that they are all obtained via an inductive process by gluing together complete and banana graphs under certain rules.
From: Yoav Len [view email]
[v1]
Mon, 24 Nov 2025 14:01:10 UTC (56 KB)
[v2]
Mon, 13 Jul 2026 10:14:04 UTC (44 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。