  A long standing open problem in extremal graph theory is to describe all
graphs that maximize the number of induced copies of a path on four vertices.
The character of the problem changes in the setting of oriented graphs, and
becomes more tractable. Here we resolve this problem in the setting of oriented
graphs without transitive triangles.
