Papers
Topics
Authors
Recent
Search
2000 character limit reached

On cyclotomic nearly-doubly-regular tournaments

Published 17 Feb 2025 in math.CO | (2502.12090v2)

Abstract: Nearly-doubly-regular tournaments have played significant roles in extremal graph theory. In this note, we construct new cyclotomic nearly-doubly-regular tournaments and determine their spectrum by establishing a new connection between cyclotomic nearly-doubly-regular tournaments and almost difference sets from combinatorial design theory. Furthermore, under the celebrated Hardy-Littlewood conjecture F in analytic number theory, our results confirm the conjecture due to Sergey Savchenko (J. Graph Theory {\bf 83} (2016), 44--77) on the existence of infinitely many nearly-doubly-regular tournaments with the canonical spectrum.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.