On the Number of Cycles in 3-Connected Cubic Graphs

Letf(n) be the minimum number of cycles present in a 3-connected cubic graph onnvertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer.53, 1986) showed thatf(n) is subexponential and conjectured thatf(n) is super-polynomial. We verify this by showing that, fornsufficiently large, 2n0.17

[1]  J. A. Bondy,et al.  Basic graph theory: paths and circuits , 1996 .

[2]  Bill Jackson,et al.  Longest cycles in 3-connected cubic graphs , 1986, J. Comb. Theory, Ser. B.

[3]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[4]  Miklós Simonovits,et al.  Longest Cycles in 3-Connected 3-Regular Graphs , 1980, Canadian Journal of Mathematics.