Abstract
The gonality of a graph is a discrete analogue of the similarly named geometric invariant of algebraic curves. Motivated by recent progress in Brill–Noether theory for graphs, we study the gonality of random graphs. In particular, we show that the gonality of a random graph is asymptotic to the number of vertices.
Citation
Andrew Deveau. David Jensen. Jenna Kainic. Dan Mitropolsky. "Gonality of random graphs." Involve 9 (4) 715 - 720, 2016. https://doi.org/10.2140/involve.2016.9.715
Information
