Further Notes on: Largest Triangle-free Subgraphs in Powers of Cycles

We derive upper bounds for the number of edges in a triangle-free subgraph of a power of a cycle, extending results of an earlier paper by Bondy and Locke. In particular, the solution found for the case \(m = 20\) is a decomposition of \(3C^{20}_n\) into odd complete graphs.