Progress on the traceability conjecture for oriented graphs
Marietjie Frick, Peter Katrenič · Discrete Mathematics & Theoretical Computer Science · 2008
Graphs and Algorithms A digraph is k-traceable if each of its induced subdigraphs of order k is traceable. The Traceability Conjecture is that for k ≥ 2 every k-traceable oriented graph of order at least 2k − 1 is traceable. The conjecture has been proved for k ≤ 5. We prove that it also holds for k = 6.