Papers › On (k,g)-Graphs without (g+1)-Cycles
On (k,g)-Graphs without (g+1)-Cycles
Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A (k,g,g+1)-graph is a k-regular graph of girth g which does not contain cycles of length g+1. Such graphs are known to exist for all parameter pairs k ≥3, g ≥3, and we focus on determining the orders n(k,g,g+1) of the smallest (k,g,g+1)-graphs. This problem can be viewed as a special case of the previously studied Girth Pair Problem, the problem of finding the order of a smallest k-regular graph in which the length of a smallest even length cycle and the length of a smallest odd length cycle are prescribed. When considering the case of an odd girth g, this problem also yields results towards the Cage Problem, the problem of finding the order of a smallest k-regular graph of girth g. We establish the monotonicity of the function n(k,g,g+1) with respect to increasing g, and present universal lower bounds for the values n(k,g,g+1). We propose an algorithm for generating all (k,g,g+1)-graphs on n vertices, use this algorithm to determine several of the smaller values n(k,g,g+1), and discuss various approaches to finding smallest (k,g,g+1)-graphs within several classes of highly symmetrical graphs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections