A note on the number of edges in a Hamiltonian graph with no repeated cycle length

Joey Lee, Craig Timmons

Let $G$ be an $n$-vertex graph obtained by adding chords to a cycle of length $n$. Markström asked for the maximum number of edges in $G$ if there are no two cycles in $G$ with the…