Abstract: | An antipath in a digraph is a semipath containing no (directed) path of length 2. A digraph D is randomly antitraceable if for each vertex v of D, any antipath beginning at v can be extended to a hamiltonian antipath beginning at v. In this paper randomly antitraceable digraphs are characterized. |