Further notes on: Largest triangle-free subgraphs in powers of cycles (Q2713605)

The circulant graph \(C_{m,n}\) has the vertices \(0,1,\ldots ,n-1\) and two vertices \(i,j\) are adjacent in it if and only if \(|i-j|\equiv k\) (mod \(n\)), where \(-m\leq k\leq m\), \(k\not = 0\). (It is assumed that \(n\geq 2m+1\).) The triangle-free subgraph of \(C_{m,n}\) with the maximum number of edges is \(T_{m,n}\) and \(t_{m,n}\) is the number \(|E(T_{m,n})|/|E(C_{m,n})|\). This number is studied for \(17 \leq m \leq 24\).