Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
Avery Carr
Published: 2025/8/25
Abstract
In this short note it is shown that every graph of diameter 2 and minimum degree at least 3 contains a cycle of length 4 or 8. This result contributes to the study of the Erd\H{o}s--Gy\'arf\'as Conjecture.