Let $\Gamma$ be a metric graph of genus $g$. Assume there exists a natural number $2 \leq r \leq g-2$ such that $\Gamma$ has a linear system $g^r_{2r}$. Then $\Gamma$ has a linear system $g^1_2$. For algebraic curves this is part of the well-known Clifford's Theorem.11 pages, 3 figuresstatus: publishe
Given a rank-r binary matroid we construct a system of $O(r^3)$ linear equations in $O(r^2)$ variabl...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
A graph has genus k if it can be embedded without edge crossings on a smooth orientable surface of g...
Let $\Gamma$ be a metric graph of genus $g$. Assume there exists a natural number $2 \leq r \leq g-...
Let Γ be a metric graph of genus g. Assume there exists a natural number 2 ≤ r ≤ g − 2 such that Γ h...
For all integers $g \geq 6$ we prove the existence of a metric graph $G$ with $w^1_4=1$ such that $G...
On a metric graph we introduce the notion of a free divisor as a replacement for the notion of a bas...
For all integers $g \geq 6$ we prove the existence of a metric graph $G$ with $w^1_4=1$ such that $G...
In the last years different techniques coming from algebraic geometry have been used also in differe...
In the last years different techniques coming from algebraic geometry have been used also in differe...
The divisor theories on finite graphs and metric graphs were introduced systematically as analogues ...
Abstract. We offer a refinement of the classical Clifford inequality about special linear series on ...
AbstractLet C be the general k-gonal curve of genus g ≥ 4, k ≥ 4, and ¦F¦ the unique pencil of degre...
AbstractWe study a family of stable curves defined combinatorially from a trivalent graph. Most of o...
A degeneration of curves gives rise to an interesting relation between linear systems on curves and ...
Given a rank-r binary matroid we construct a system of $O(r^3)$ linear equations in $O(r^2)$ variabl...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
A graph has genus k if it can be embedded without edge crossings on a smooth orientable surface of g...
Let $\Gamma$ be a metric graph of genus $g$. Assume there exists a natural number $2 \leq r \leq g-...
Let Γ be a metric graph of genus g. Assume there exists a natural number 2 ≤ r ≤ g − 2 such that Γ h...
For all integers $g \geq 6$ we prove the existence of a metric graph $G$ with $w^1_4=1$ such that $G...
On a metric graph we introduce the notion of a free divisor as a replacement for the notion of a bas...
For all integers $g \geq 6$ we prove the existence of a metric graph $G$ with $w^1_4=1$ such that $G...
In the last years different techniques coming from algebraic geometry have been used also in differe...
In the last years different techniques coming from algebraic geometry have been used also in differe...
The divisor theories on finite graphs and metric graphs were introduced systematically as analogues ...
Abstract. We offer a refinement of the classical Clifford inequality about special linear series on ...
AbstractLet C be the general k-gonal curve of genus g ≥ 4, k ≥ 4, and ¦F¦ the unique pencil of degre...
AbstractWe study a family of stable curves defined combinatorially from a trivalent graph. Most of o...
A degeneration of curves gives rise to an interesting relation between linear systems on curves and ...
Given a rank-r binary matroid we construct a system of $O(r^3)$ linear equations in $O(r^2)$ variabl...
The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface ...
A graph has genus k if it can be embedded without edge crossings on a smooth orientable surface of g...
DOI
Add to ORKG