arXiv · 1304.6101
Clifford's Theorem for graphs
Abstract
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.
Explore related subjects
Keep this discovery
Marc Coppens. 2013-04-22. Clifford's Theorem for graphs. https://arxiv.org/abs/1304.6101
Cite the original work for its findings. Save a collection to share your selection of sources.