Constructions for Cubic Graphs with Large Girth

The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of vertices for which a cubic graph with girth at least g exists, and furthermore, the minimum value µ0(g) is attained by a graph whose girth is exactly g. The values of µ0(g) when 3 ≤ g ≤ 8 have been known for over thirty years. For these values of g each minimal graph is unique and, apart from the case g = 7, a simple lower bound is attained. This paper is mainly concerned with what happens when g ≥ 9, where the situation is quite different. Here it is known that the simple lower bound is attained if and only if g = 12. A number of techniques are described, with emphasis on the construction of families of graphs {Gi} for which the number of vertices ni and the girth gi are such that ni ≤ 2cgi for some finite constant c. The optimum value of c is known to lie between 0.5 and 0.75. At the end of the p...

• Type: Journal
• Year: 1998
• Where: COMBINATORICS
• Authors: Norman Biggs
• Keywords: COMBINATORICS 1998, Cubic Graph, Large Girth, Simple Lower Bound