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.
|Number of pages||6|
|State||Published - 2016|
Bibliographical noteFunding Information:
This paper was written as part of the 2014 Summer Undergraduate Math Research at Yale (SUMRY) program. We would like to extend our thanks to everyone involved in the program, and in particular to Sam Payne, who suggested this project. We also thank Matt Kahle for a particularly fruitful discussion.
© 2016, Mathematical Sciences Publishers. All rights reserved.
- Brill–Noether theory
- random graphs
ASJC Scopus subject areas
- Mathematics (all)