Abstract
We prove a sharp upper bound on the number of shortest cycles contained inside any connected graph in terms of its number of vertices, girth, and maximal degree. Equality holds only for Moore graphs, which gives a new characterization of these graphs. In the case of regular graphs, our result improves an inequality of Teo and Koh. We also show that a subsequence of the Ramanujan graphs of Lubotzky-Phillips-Sarnak have super-linear kissing numbers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Azarija and S. Klavzar: Moore graphs and cycles are extremal graphs for convex cycles, J. Graph Theory 80 (2015), 34–42.
N. Alon: Eigenvalues and expanders, volume 6, 83–96. 1986, Theory of computing (Singer Island, Fla., 1984).
P. T. Bateman: On the representations of a number as the sum of three squares, Trans. Amer. Math. Soc. 71 (1951), 70–101.
N. L. Biggs and A. G. Boshier: Note on the girth of Ramanujan graphs, J. Combin. Theory Ser. B 49 (1990), 190–194.
B. Bollobás and W. Fernandez de la Vega: The diameter of random regular graphs, Combinatorica 2 (1982), 125–134.
N. L. Biggs and M. J. Hoare: The sextet construction for cubic graphs, Combinatorica 3 (1983), 153–165.
N. Biggs: Algebraic graph theory, Cambridge Mathematical Library. Cambridge University Press, Cambridge, second edition, 1993.
N. Biggs: Constructions for cubic graphs with large girth, Electron. J. Combin. 5 (25, 1998), Article 1.
J. H. Conway and N. J.A. Sloane: Sphere packings, lattices and groups, volume 290 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Springer-Verlag, New York, third edition, 1999. (With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.)
X. Dahan: Regular graphs of large girth and arbitrary degree, Combinatorica 34 (2014), 407–426.
G. Davidoff, P. Sarnak and A. Valette: Elementary number theory, group theory, and Ramanujan graphs, volume 55 of London Mathematical Society Student Texts, Cambridge University Press, Cambridge, 2003.
P. Erdős and H. Sachs: Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 12 (1963), 251–257.
M. Fortier Bourque and B. Petri: Kissing numbers of closed hyperbolic manifolds. To appear in the American Journal of Mathematics, 2021+.
F. Fanoni and H. Parlier: Systoles and kissing numbers of finite area hyperbolic surfaces, Algebr. Geom. Topol. 15 (2015), 3409–3433.
E. Grosswald: Representations of integers as sums of squares, Springer-Verlag, New York, 1985.
N. Homobono and C. Peyrat: Graphs such that every two edges are contained in a shortest cycle, Discrete Math. 76 (1989), 37–44.
W. Imrich: Explicit construction of regular graphs without small cycles, Combinatorica 4 (1984), 53–59.
A. Lubotzky, R. Phillips and P. Sarnak: Ramanujan graphs, Combinatorica 8 (1988), 261–277.
N. Linial and M. Simkin: A randomized construction of high girth regular graphs, Random Structures & Algorithms 58 (2021), 345–369.
A. Lubotzky: Discrete groups, expanding graphs and invariant measures, Modern Birkhäuser Classics. Birkhäuser Verlag, Basel, 2010. (With an appendix by Jonathan D. Rogawski, Reprint of the 1994 edition.)
G. A. Margulis: Explicit constructions of graphs without short cycles and low density codes, Combinatorica 2 (1982), 71–78.
G. A. Margulis: Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators, Problemy Peredachi Informatsii 24 (1988), 51–60.
B. D. McKay: Practical graph isomorphism, Congr. Numer. 30 (1981), 45–87.
M. Morgenstern: Existence and explicit constructions of q + 1 regular Ramanujan graphs for every prime power q, J. Combin. Theory Ser. B 62 (1994), 44–62.
B. D. McKay, N. C. Wormald and B. Wysocka: Short cycles in random regular graphs, Electron. J. Combin. 11 (12, 2004), Research Paper 66.
H. Parlier: Kissing numbers for surfaces, J. Topol. 6 (2013), 777–791.
P. Sarnak: Some applications of modular forms, volume 99 of Cambridge Tracts in Mathematics, Cambridge University Press, Cambridge, 1990.
N. T. Sardari: Diameter of Ramanujan graphs and random Cayley graphs, Combinatorica 39 (2019), 427–446.
P. Schmutz: Systoles on Riemann surfaces, Manuscripta Math. 85 (1994), 429–447.
C. L. Siegel: Gesammelte Abhandlungen. I, Springer Collected Works in Mathematics. Springer, Heidelberg, 2015, edited by Komaravolu Chandrasekharan and Hans Maaß, Reprint of the 1966 edition.
P. Schmutz Schaller: Extremal Riemann surfaces with a large number of systoles, in: Extremal Riemann surfaces (San Francisco, CA, 1995), volume 201 of Contemp. Math., 9–19. Amer. Math. Soc., Providence, RI, 1997.
The Sage Developers: SageMath, the Sage Mathematics Software System (Version 8.7), 2019, https://www.sagemath.org.
C. P. Teo and K. M. Koh: The number of shortest cycles and the chromatic uniqueness of a graph, J. Graph Theory 16 (1992), 7–15.
S. Vlăduţ: Lattices with exponentially large kissing numbers, Mosc. J. Comb. Number Theory 8 (2019), 163–177.
M. A. van Opstall and R. Veliche: Cubic graphs with most automorphisms, J. Graph Theory 64 (2010), 99–115.
A. Walfisz: Zur additiven Zahlentheorie. II, Math. Z. 40 (1936), 592–607.
R. M. Weiss: Über s-reguläre Graphen, J. Combinatorial Theory Ser. B 16 (1974), 229–233.
A. Weiss: Girths of bipartite sextet graphs, Combinatorica 4 (1984), 241–245.
N. Wormald: On the number of automorphisms of a regular graph, Proc. Amer. Math. Soc. 76 (1979), 345–348.
