Kissing numbers of regular graphs
From MaRDI portal
Publication:2095114
DOI10.1007/s00493-021-4671-xOpenAlexW3216341204MaRDI QIDQ2095114
Maxime Fortier Bourque, Bram Petri
Publication date: 9 November 2022
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.12817
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular graphs of large girth and arbitrary degree
- Explicit construction of regular graphs without small cycles
- Systoles and kissing numbers of finite area hyperbolic surfaces
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Note on the girth of Ramanujan graphs
- Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
- The sextet construction for cubic graphs
- Girths of bipartite sextet graphs
- Ramanujan graphs
- Eigenvalues and expanders
- Graphs such that every two edges are contained in a shortest cycle
- Explicit constructions of graphs without short cycles and low density codes
- Über s-reguläre Graphen
- Constructions for cubic graphs with large girth
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Systoles on Riemann surfaces
- Short cycles in random regular graphs
- The diameter of random regular graphs
- Diameter of Ramanujan graphs and random Cayley graphs
- Lattices with exponentially large kissing numbers
- Zur additiven Zahlentheorie. II
- Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles
- On the Number of Automorphisms of a Regular Graph
- Cubic graphs with most automorphisms
- The number of shortest cycles and the chromatic uniqueness of a graph
- Algebraic Graph Theory
- Kissing numbers of closed hyperbolic manifolds
- Kissing numbers for surfaces
- On the Representations of a Number as the Sum of Three Squares
- A randomized construction of high girth regular graphs
This page was built for publication: Kissing numbers of regular graphs