Triangle-free subgraphs of powers of cycles (Q1196562)

Let \(C_{m,n}\) be the \(m\)-th power of an \(n\)-cycle, \(T_{m,n}\) a triangle-free subgraph of \(C_{m,n}\) with maximum number of edges, and \(t_{m,n}=| E(T_{m,n})|\left/|\right.E(C_{m,n})|\). Authors give upper bounds for \(t_{m,n}\) by a linear programming approach, and by applying results on graceful graphs.