Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
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 Erdos-Gy\'arf\'as Conjecture by confirming it for the class of diameter-2 graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.