An extreme problem concerning k-arc-cyclic property for a class of tournaments (Q757403)

For fixed integers q and k let \(N=N(q,k)\) denote the smallest integer with the following property: if \(T_ n\) is a tournament with \(n\geq N\) nodes in which \(d^+(v)+d^-(u)\leq n-q\) for every arc uv of \(T_ n\), then every arc of \(T_ n\) belongs to a k-cycle. The authors show that \(N(q,4)=5q-7\) for \(q>1\) and they determine N(q,5) to within one when \(q\geq 15\).