Dipaths of length at least double the minimum outdegree

12 Aug 2016 DeLong Joe

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS