Dipaths of length at least double the minimum outdegree

Joe DeLong

A special case of a conjecture by Thomassé is that any oriented graph with minimum outdegree k contains a dipath of length 2k. For the sake of proving whether or not a counterexamp…