Antidirected hamiltonian paths between specified vertices of a tournament Original Research Article

We prove that in any tournament there is an antidirected hamiltonian path from a specified first vertex to a specified last vertex, and starting with an arc of specified direction, as long as both the first vertex and the last vertex satisfy an obvious minimally necessary condition. We apply this result to give a polynomial time algorithm to find an antidirected hamiltonian path between two specified vertices of an input tournament.