Packing of two digraphs into a transitive tournament (Q868371)

It can be shown that if the number of arcs in a digraph of order \(n\) without directed cycles is sufficiently small, not greater than \(3(n - 1)/4\), then two copies of this digraph are packable into a transitive tournament. The paper presents a generalization of this result by showing that if the sum of the sizes of two digraphs of order \(n\) without directed cycles is not greater than \(3(n - 1)/2\), then these two digraphs are packable into a transitive tournament.