Abstract
In (3) Tutte showed that the order of a regular graph of degree d and even girth g > 4 is greater than or equal toHere the girth of a graph is the length of the shortest circuit. It was shown in (2) that this lower bound cannot be attained for regular graphs of degree > 2 for g ≠ 6, 8, or 12. When this lower bound is attained, the graph is called minimal. In a group-theoretic setting a similar situation arose and it was noticed by Gleason that minimal regular graphs of girth 12 could be constructed from certain groups. Here we construct these graphs making only incidental use of group theory. Also we give what is believed to be an easier construction of minimal regular graphs of girth 8 than is given in (2). These results are contained in the following two theorems.
Publisher
Canadian Mathematical Society
Cited by
136 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Improved Lower Bounds for Multiplicative Square-Free Sequences;The Electronic Journal of Combinatorics;2023-12-01
2. Tight bounds for powers of Hamilton cycles in tournaments;Journal of Combinatorial Theory, Series B;2023-01
3. Generalized Rainbow Turán Numbers;The Electronic Journal of Combinatorics;2022-06-03
4. Bipartite Turán Problems for Ordered Graphs;Combinatorica;2022-01-14
5. Ramsey Numbers for Nontrivial Berge Cycles;SIAM Journal on Discrete Mathematics;2022-01-04