Tournaments as strong subcontractions (Q1377688)

If \(H\) is a digraph with vertex set \(\{v_1,\dots, v_p\}\), then \(H\) is a strong subcontraction of \(D\) if and only if there exists a partition of the vertices of \(D\) into subsets \(V_0,\dots, V_p\) such that \(D[V_i]\) is strongly connected for \(1\leq i\leq p\), and, for every edge \(v_iv_j\) in \(E(H)\), there exists a corresponding edge in \(D\) from \(V_i\) to \(V_j\). The paper describes good bounds for the maximum number of edges in a digraph which has no strong subcontraction to a tournament of order \(p\). In particular the case when the tournament is transitive is considered.