Let $g_k(n)$ be the maximal number of edges possible on a graph with $n$ vertices which does not contain a cycle with $k$ chords incident to a vertex on the cycle. Is it true that$$g_k(n)=(k+1)n-(k+1{)}^2$$for $n$ sufficiently large?