Small graphs and hypergraphs of given degree and girth
From MaRDI portal
Publication:6388570
DOI10.37236/11765arXiv2201.07117MaRDI QIDQ6388570FDOQ6388570
Authors: Grahame Erskine, James Tuite 
Publication date: 18 January 2022
Abstract: The search for the smallest possible -regular graph of girth has a long history, and is usually known as the cage problem. This problem has a natural extension to hypergraphs, where we may ask for the smallest number of vertices in a -regular, -uniform hypergraph of given (Berge) girth . We show that these two problems are in fact very closely linked. By extending the ideas of Cayley graphs to the hypergraph context, we find smallest known hypergraphs for various parameter sets. Because of the close link to the cage problem from graph theory, we are able to use these techniques to find new record smallest cubic graphs of girths 23, 24, 28, 29, 30, 31 and 32.
Vertex degrees (05C07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Hypergraphs (05C65)
This page was built for publication: Small graphs and hypergraphs of given degree and girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6388570)
