Clifford's Theorem for graphs

2013/04/22 by Marc Coppens, Coppens, Marc · 1 citation
Mathematics · #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #FOS: Mathematics #math.AG #math.CO

paper · pdf · doi:10.48550/arxiv.1304.6101

11 pages, 3 figures

arxiv created 2013/04/22 · arxiv updated 2013/04/24

Abstract

Let Γ be a metric graph having a linear system g^r_2r for some 2 ≤ r ≤ g-2 then Γ has a linear system g¹₂. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth projective curves.

Cited by

• A tropical version of Martens' theorem for metric graphs

Related

• Free divisors on metric graphs
• A metric graph satisfying w¹₄=1 that cannot be lifted to a curve satisfying dim (W¹₄)=1
• Linear systems on graphs with a real structure
• Specialization of linear systems from curves to graphs
• Linear pencils on graphs and on real curves