Gonality of expander graphs
From MaRDI portal
Publication:724872
DOI10.1016/J.DISC.2018.06.012zbMATH Open1392.05099OpenAlexW2963815058MaRDI QIDQ724872FDOQ724872
Abstract: We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.
Recommendations
- On expansive graphs
- Expander graphs and their applications
- Expander graphs, gonality, and variation of Galois representations
- On constructing expander families of G-graphs
- Expander graphs in pure and applied mathematics
- scientific article; zbMATH DE number 7052900
- On the Edge-Expansion of Graphs
- scientific article; zbMATH DE number 2196285
- Gonality sequences of graphs
- A new family of expansive graphs
Cites Work
- scientific article; zbMATH DE number 510844 (Why is no real title available?)
- scientific article; zbMATH DE number 714489 (Why is no real title available?)
- scientific article; zbMATH DE number 2196285 (Why is no real title available?)
- scientific article; zbMATH DE number 3353448 (Why is no real title available?)
- A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
- A combinatorial Li-Yau inequality and rational points on curves
- A note on Brill-Noether existence for graphs of low genus
- A proof of Alon’s second eigenvalue conjecture and related problems
- Chip-firing games, potential theory on graphs, and spanning trees
- Fast linear algebra is stable
- Gonality of random graphs
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Isoperimetric numbers of graphs
- Lower bounds for the isoperimetric numbers of random regular graphs
- On metric graphs with prescribed gonality
- On the Existence of Special Divisors
- On the tropical Torelli map
- On the variety of special linear systems on a general algebraic curve
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Self-organized critical state of sandpile automaton models
- Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
- The isoperimetric number of random regular graphs
Cited In (7)
- On constructing expander families of G-graphs
- A new lower bound on graph gonality
- Gonality of random graphs
- On Constructing Expanders for Any Number of Vertices
- Expander graphs, gonality, and variation of Galois representations
- Recognizing hyperelliptic graphs in polynomial time
- Chip-firing games and critical groups
Uses Software
This page was built for publication: Gonality of expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724872)
