... shown that cubic graphs with arbitrarily large girth exist (see Theorem 3.2) and so there is a well-defined integer µ0 (g), the smallest number of vertices for which a cubic graph with girth at ... Mathematics and its Applications, 1972, pp 1–17 N L Biggs, Graphs with large girth Ars Combinatorica 25C (1987) 73–80 N L Biggs, Cubic graphs with large girth (In: Combinatorial Mathematics: Proceedings ... for cubic graphs Combinatorica (1983) 153–165 12 B Bollob´s, Extremal Graph Theory Academic Press, London 1978 a 13 J Bray, C Parker, and P Rowley, Graphs related to Cayley graphs and cubic graphs...