Gonality of random graphs

Andrew Deveau; David Jensen; Jenna Kainic; Dan Mitropolsky

doi:10.2140/involve.2016.9.715

Gonality of random graphs

Andrew Deveau, David Jensen, Jenna Kainic, Dan Mitropolsky

Mathematics

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

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.

Original language	English
Pages (from-to)	715-720
Number of pages	6
Journal	Involve
Volume	9
Issue number	4
DOIs	https://doi.org/10.2140/involve.2016.9.715
State	Published - 2016

Bibliographical note

Publisher Copyright:
© 2016, Mathematical Sciences Publishers. All rights reserved.

Keywords

Brill–Noether theory
chip-firing
gonality
random graphs

ASJC Scopus subject areas

General Mathematics

Access to Document

10.2140/involve.2016.9.715

Cite this

@article{b5a80b149b2e4661849242de7d4c8636,

title = "Gonality of random graphs",

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.",

keywords = "Brill–Noether theory, chip-firing, gonality, random graphs",

author = "Andrew Deveau and David Jensen and Jenna Kainic and Dan Mitropolsky",

year = "2016",

doi = "10.2140/involve.2016.9.715",

language = "English",

volume = "9",

pages = "715--720",

journal = "Involve",

issn = "1944-4176",

publisher = "Mathematical Sciences Publishers",

number = "4",

}

TY - JOUR

T1 - Gonality of random graphs

AU - Deveau, Andrew

AU - Jensen, David

AU - Kainic, Jenna

AU - Mitropolsky, Dan

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Brill–Noether theory

KW - chip-firing

KW - gonality

KW - random graphs

UR - http://www.scopus.com/inward/record.url?scp=85048866780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048866780&partnerID=8YFLogxK

U2 - 10.2140/involve.2016.9.715

DO - 10.2140/involve.2016.9.715

M3 - Article

AN - SCOPUS:85048866780

SN - 1944-4176

VL - 9

SP - 715

EP - 720

JO - Involve

JF - Involve

IS - 4

ER -

Gonality of random graphs

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this