English
Related papers

Related papers: A note on Brill--Noether existence for graphs of l…

200 papers

For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…

Combinatorics · Mathematics 2025-07-10 Jonathan L. Merzel , Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…

Combinatorics · Mathematics 2011-01-14 Bojan Mohar

In this paper we study Cartesian products of graphs and their divisorial gonality, which is a tropical version of the gonality of an algebraic curve. We present an upper bound on the gonality of the Cartesian product of any two graphs, and…

Combinatorics · Mathematics 2019-09-24 Ivan Aidun , Ralph Morrison

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

Combinatorics · Mathematics 2023-06-23 Guillaume Chapuy , Guillem Perarnau

We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr\"obner theory. We give an explicit description of a minimal Gr\"obner bases for each higher syzygy module. In each…

Combinatorics · Mathematics 2019-10-21 Fatemeh Mohammadi , Farbod Shokrieh

For an $n$-vertex graph $G$, let $h(G)$ denote the smallest size of a subset of $V(G)$ such that it intersects every maximum independent set of $G$. A conjecture posed by Bollob\'{a}s, Erd\H{o}s and Tuza in early 90s remains widely open,…

Combinatorics · Mathematics 2024-12-06 Xinbu Cheng , Xinqi Huang , Mingyuan Rong , Zixiang Xu

The gonality sequence $(d_r)_{r\geq1}$ of a smooth algebraic curve comprises the minimal degrees $d_r$ of linear systems of rank $r$. We explain two approaches to compute the gonality sequence of smooth curves in $\mathbb{P}^1 \times…

Algebraic Geometry · Mathematics 2017-09-22 Filip Cools , Michele D'Adderio , David Jensen , Marta Panizzut

In this paper, we survey recent developments in the Brill-Noether Theory of higher rank vector bundles on complex projective surfaces. We focus on weak Brill-Noether Theorems on rational and K-trivial surfaces and their applications.

Algebraic Geometry · Mathematics 2023-06-21 Izzet Coskun , Jack Huizenga , Howard Nuer

This paper gives a novel and compact proof that a metric graph consisting of a chain of loops of torsion order $0$ is Brill-Noether general (a theorem of Cools-Draisma-Payne-Robeva), and a finite or metric graph consisting of a chain of…

Combinatorics · Mathematics 2022-03-02 Nathan Pflueger

On an arbitrary compact Riemann surface, necessary and sufficient conditions are found for the existence of semistable vector bundles with slope between zero and one and a prescribed number of linearly independent holomorphic sections.…

alg-geom · Mathematics 2008-02-03 Georgios Daskalopoulos , Richard Wentworth

Our purpose in this paper is to construct new examples of twisted Brill Noether loci on curves of genus g greater than 2 with negative expected dimension. We begin by completing the proof of Butler's conjecture for coherent systems of…

Algebraic Geometry · Mathematics 2026-04-21 L. Brambila-Paz , P. E. Newstead

We provide an example of a trivalent, 3-connected graph G such that, for any choice of metric on G, the resulting metric graph is Brill-Noether special.

Algebraic Geometry · Mathematics 2016-02-12 David Jensen

Erd\H{o}s, Faudree, Rousseau and Schelp observed the following fact for every fixed integer $k\geq 2$: Every graph on $n\geq k-1$ vertices with at least $(k-1)(n-k+2)+{k-2\choose 2}$ edges contains a subgraph with minimum degree at least…

Combinatorics · Mathematics 2018-06-28 Lisa Sauermann

The distinguishing index of a simple graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of $G$ not preserved by any non-trivial automorphism. It was conjectured by Pil\'sniak (2015) that for any 2-connected…

Combinatorics · Mathematics 2017-02-14 Saeid Alikhani , Samaneh Soltani

In this paper we consider the singularities of the varieties parameterizing stable vector bundles of fixed rank and degree with sections on a smooth curve of genus at least two. In particular, we extend results of Y. Laszlo, and of the…

Algebraic Geometry · Mathematics 2012-07-05 Sebastian Casalaina-Martin , Montserrat Teixidor i Bigas

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…

Combinatorics · Mathematics 2018-10-10 Florian Lehner , Monika Pilśniak , Marcin Stawiski

This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal…

Combinatorics · Mathematics 2021-07-07 Josse van Dobben de Bruyn , Harry Smit , Marieke van der Wegen

Let $\M_g$ be the course moduli space of complex projective nonsingular curves of genus $g$. We prove that when the Brill-Noether number $\rho(g,1,n)$ is non-negative the Petri locus $P^1_{g,n}\subset \M_g$ has a divisorial component whose…

Algebraic Geometry · Mathematics 2011-06-17 A. Bruno , E. Sernesi

We prove for every graph H there exists a>0 such that, for every graph G with at least two vertices, if no induced subgraph of G is a subdivision of H, then either some vertex of G has at least a|G| neighbours, or there are two disjoint…

Combinatorics · Mathematics 2020-06-03 Maria Chudnovsky , Alex Scott , Paul Seymour , Sophie Spirkl

To any graph we associate a sequence of integers called the gonality sequence of the graph, consisting of the minimum degrees of divisors of increasing rank on the graph. This is a tropical analogue of the gonality sequence of an algebraic…

Combinatorics · Mathematics 2021-04-19 Ivan Aidun , Frances Dean , Ralph Morrison , Teresa Yu , Julie Yuan
‹ Prev 1 3 4 5 6 7 10 Next ›