Counting orientations of graphs with no strongly connected tournaments

Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota

Let $S_k(n)$ be the maximum number of orientations of an $n$-vertex graph $G$ in which no copy of $K_k$ is strongly connected. For all integers $n$, $k\ge 4$ where $n\ge 5$ or $k…