Dipaths of length at least double the minimum outdegree
  A special case of a conjecture by Thomass\'e is that any oriented graph with minimum outdegree k contains a dipath of length 2k. For the sake of proving whether or not a counterexample exists, we present reductions and establish bounds on both connectivity and the number of vertices in a counterexample. We further conjecture that in any oriented graph with minimum outdegree k, every vertex belongs to a dipath of length 2k. 
Joe DeLong
math.CO