English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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\geq4$ where $n\geq 5$ or $k\geq 5$, we prove that $S_k(n) = 2^{t_{k-1}(n)}$, where$t_{k-1}(n)$ is the number of edges of the $n$-vertex $(k-1)$-partite Tur\'angraph $T_{k-1}(n)$, and that $T_{k-1}(n)$ is the only $n$-vertex graph withthis number of orientations. Furthermore, $S_4(4) = 40$ and this maximality isachieved only by $K_4$.

Counting orientations of graphs with no strongly connected tournaments