Orientations of Hamiltonian cycles in bipartite digraphs (Q1337013)

Let \(D= (X,Y,A)\) be a bipartite balanced digraph with node sets \(X\), \(Y\); \(| X|= | Y|= n\) and with arc set \(A\) fulfilling \(| A|\geq 2n^ 2- 2n+3\). Then the authors prove that \(D\) contains an almost Hamiltonian cycle unless \(D\) has a vertex which is not incident to any symmetric arc of \(D\). The authors compare their result with the actual literature.