Clifford's Theorem for graphs

Let $Γ$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $Γ$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth projective curves.

No reviews yet.

No comments yet.