2000 character limit reached
A new approach to pancyclicity of Paley graphs I
Published 9 Aug 2023 in math.CO | (2308.04759v4)
Abstract: Let $G$ be an undirected graph of order $n$ and let $C_i$ be an $i$-cycle graph. $G$ is called pancyclic if $G$ contains a $C_i$ for any $i\in {3,4,\ldots,n}$. We show that the pancyclicity of specific Cayley graphs and the Cartesian product of specific two graphs. As a corollary of these two theorems, we provide a new proof of the pancyclicity of the Paley graph.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.