arXiv (All)
open access
On the gonality of Kneser graphs
The Kneser graphs $\text{KG}(n,k)$ are a classically studied family of graphs. One known invariant of graphs is gonality (also called divisorial gonality), which is the minimum degree of a rank 1 divisor on the graph. Using known bounds on gonality of simple, connected graphs, one may obtain that th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the gonality of Kneser graphs#809719
- Classifying Prime Character Degree Graphs With Eight Vertices#1048599
- Periodic efficient total girth colorings in cubic maps of girth 4 correspond to 3-permutation face colorings#1130180
- A Nine-Element Minor Theorem for 3-Connected Nonbinary Matroids with a W4-Minor#1065631
- Einsatz von nachwachsenden Rohstoffen auf Kohlehydratbasis in der Lackindustrie : Saccharosefolgechemie II, Teilvorhaben 7 ; Berichtszeitraum: 2001 - 2003#1124305
Record · ID 819715
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive