OpenAlex ·
Hamiltonicity in graphs defined by primes and primitive elements
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.19114
- Original
- Read it at the publisher
- Topics
Abstract
A prime circle of order $2n$ is a circular ordering of $1,\ldots,2n$ such that the sum of every two adjacent terms is prime. We prove that a prime circle exists for every sufficiently large $n$. The proof is based on a perfect matching and robust expansion. We also study Hamilton cycles in graphs and digraphs defined by primitive sums and differences over finite fields. In particular, the primitive-sum graph on $\F_q$ is Hamiltonian for every prime power $q>18\,888\,871$, and for the graph on a full prime field $\F_p$, the bound improves to $p>61$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Branched real projective structures on surfaces and geometrisation of representations
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Kernel--wreath constructions and infinite families of finite simple skew braces
The Drinfeld associator and $A_\infty$ functors
Classification of Automorphism Groups of Smooth Cubic Threefolds and Fourfolds
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.