Clifford's Theorem for graphs

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.

Publication year:2016

BOF-keylabel:yes

IOF-keylabel:yes

BOF-publication weight:1

CSS-citation score:1

Authors from:Higher Education

Accessibility:Closed