A digraph operation called pushing a set of vertices is studied with respect to tournaments. When a set \(X\) of vertices is pushed, the orientation of every arc with exactly one end in \(X\) is reversed. We discuss the problems of which tournaments can be made transitive and which can be made isomorphic to their converse using this operation.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.