Changes

Jump to: navigation, search

Rank of graph divisors

6 bytes added, 12:35, 7 November 2016
<onlyinclude>
The '''rank ''' of divisor <math>D</math> is the smallest number <math>G</math> such that by subtracting a divisor of degree <math>k+1</math> from <math>D</math>, we can get a divisor which is not [[linear equivalence of graph divisors|linearly equivalent]] to an effective divisor.
</onlyinclude>
Egresuser
179
edits