Abstract
An explicit construction of Biggs and Hoare yields an infinite family of bipartite cubic graphs. We prove that the ordern and girthg of each of these graphs are related by log2 n<3/4·g+3/2.
Similar content being viewed by others
References
N. L. Biggs,Algebraic Graph Theory, Cambridge, 1974.
N. L. Biggs andM. J. Hoare, The sextet construction for cubic graphs,Combinatorica 3 (1983), 153–165.
B. Bollobás,Extremal Graph Theory, Academic Press, 1978.
D. Z. Djoković andG. L. Miller, Regular groups of automorphisms of cubic graphs,J. Combinatorial Theory (B) 29 (1980) 195–230.
P. Erdös, andH. Sachs, Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl.Wiss. Z. Univ. Halle—Wittenberg, Math.-Nat. R. 12 (1963), 251–258.
I. Reiner,Maximal Orders, Academic Press, 1975.