Progress on the traceability conjecture for oriented graphs
Marietjie Frick (1), Peter Katrenič (2)
(1) Department of Mathematical Sciences [South Africa]
(2) Institute of Mathematics [Kosice, Slovakia]
Abstract
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.
