MathNet 2026 — Part 08 Question 198

Show that for sufficiently large primes $p$, there is an Eulerian circuit on the complete graph with $p$ vertices that does not contain any cycles of length at most $2023$.