Answers are grounded in this paper and cite their sources.
Erdős and Gyárfás conjectured that every graph with minimum degree at least three contains a power-of-two-length cycle. We prove every Cayley graph of odd order satisfies the conjecture. As a corollary, we find that Cayley graphs of finite nilpotent groups satisfy the conjecture as well.
No takes yet. Share an insight, caveat, or question.
Michael C. Burkhart (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: