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

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\Delta(G)\leq r$, which has the most…

In this note, we give an overview of a new technique for studying Brill--Noether curves in projective space via degeneration. In particular, we give a roadmap to the proof of the Maximal Rank Conjecture.

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…

In this paper, we compute the number of general points through which a general Brill-Noether curve in $\mathbb{P}^4$ passes. We also prove an analogous theorem when some points are constrained to lie in a transverse hyperplane. As explained…

We prove that every graph $G$ on $n$ vertices with no isolated vertices contains an induced subgraph of size at least $n/10000$ with all degrees odd. This solves an old and well-known conjecture in graph theory.

Let C be a smooth projective curve over the field of the complex numbers. We consider Brill-Noether loci over the moduli of maps from C to the Grassmannian G(m,n) and the corresponding Quot schemes of quotients of a trivial vector bundle on…

There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree…

For a projective variety X, a line bundle L on X and r a natural number we consider the r-th Brill-Noether locus W^r(L,X):={\eta\in Pic^0(X)|h^0(L+\eta)\geq r+1}: we describe its natural scheme structure and compute the Zariski tangent…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

A Brill-Noether degeneracy locus is closure in $\Pic^d(C)$ of the locus of line bundles with a specified rank function $r(a,b) = h^0(C,L(-ap-bq))$. These loci generalize the classical Brill-Noether loci $W^r_d(C)$ as well as Brill-Noether…

In this paper we study the Brill Noether locus of rank 2, (semi)stable vector bundles with at least two sections and of suitable degrees on a general $\nu$-gonal curve. We classify its reduced components whose dimensions are at least the…

Reed conjectured that for any graph $G$, $\chi(G) \leq \lceil \frac{\omega(G)+\Delta(G)+1}{2}\rceil$, where $\chi(G)$, $\omega(G)$, and $\Delta(G)$ respectively denote the chromatic number, the clique number and the maximum degree of $G$.…

Brill-Noether theory of curves has played a crucial role in the study of curves and their moduli since the 19th century, and has been extensively studied by several authors. Clifford's theorem provides a starting point in determining the…

In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every $n$-vertex $2$-connected graph $G$ with minimum vertex degree $\delta\geq 2$ contains a cycle with at least $\min\{2\delta,n\}$…

A divisor graph $G$ is an ordered pair $(V, E)$ where $V \subset \mathbbm{Z}$ and for all $u \neq v \in V$, $u v \in E$ if and only if $u \mid v$ or $v \mid u$. A graph which is isomorphic to a divisor graph is also called a divisor graph.…

Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…

For a graph $G$, the $k$-colouring graph of $G$ has vertices corresponding to proper $k$-colourings of $G$ and edges between colourings that differ at a single vertex. The graph supports the Glauber dynamics Markov chain for $k$-colourings,…

We prove that every graph of minimum degree at least $d \ge 1$ contains a subdivision of some maximal 3-degenerate graph of order $d+1$. This generalizes the classic results of Dirac ($d=3$) and Pelik\'an ($d=4$). We conjecture that for any…

Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t+1}$ minor, then its vertex set $V(G)$ can be partitioned into $t$ stable sets. This is still open, but we prove under the same hypotheses that $V(G)$ can be partitioned…

We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H) is connected and contains x. This implies an affirmative…