Let Sk(n) be the maximum number of orientations of an n-vertex graph G in which no copy of Kk is strongly connected. For all integers n, k ≥ 4 where n ≥ 5 or k ≥ 5, we prove that Sk(n) = 2tk - 1(n), where tk-1(n) is the ...