Odd cycles in symmetric Cayley graphs on prime cyclic groups
Abstract
Let p be an odd prime and let S⊂eq p be symmetric with 0 S. Let (p,S) be the undirected Cayley graph on p in which x and y are adjacent if and only if x-y∈ S. For 1 (p-1)/2, define \[ (C2+1,p)=\|S|: S=-S,\ 0 S,\ (p,S) contains no C2+1\. \] Confirming a conjecture of Cashman and Kelley, we prove that if p=2+1, then (C2+1,p)=0, while if p>2+1, then \[ (C2+1,p)=2p+2+12(2+1). \] The proof combines a sharp additive zero-sum odd-girth argument with weak odd pancyclicity to transfer the result from odd-girth exclusion to fixed odd-cycle exclusion. We also give a canonical extremal family, an exact extremality criterion in terms of odd zero-sum avoidance, and an example showing that extremizers need not be dilates of the canonical construction.
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.