Pancyclicity when each cycle must pass exactly $k$ Hamilton cycle chords

TL;DR

This paper investigates the minimum number of chords needed to ensure the existence of cycles of every length passing exactly $k$ chords in a graph derived from an n-cycle, establishing a lower bound of (n^{1/k}).

Contribution

It introduces a new intermediate problem in graph theory and provides a lower bound on the number of chords needed for cycles passing exactly k chords.

Findings

Established a lower bound of (n^{1/k}) on the number of chords needed.

Connected the problem to existing results on pancyclic and vertex pancyclic graphs.

Abstract

It is known that $\Theta(\log n)$ chords must be added to an $n$-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, $\Theta(n)$ chords are required. A possibly `intermediate' variation is the following: given $k$, $1\leq k\leq n$, how many chords must be added to ensure that there exist cycles of every length each of which passes exactly $k$ chords? For fixed $k$, we establish a lower bound of $\Omega\big(n^{1/k}\big)$ on the growth rate.