Hamilton Cycles in a Class of Random Directed Graphs

We prove that almost every 3-in, 3-out digraph is Hamiltonian.