Independent transversals of longest paths in locally semicomplete and locally transitive digraphs.

Hortensia Galeana Sánchez, Ricardo Gómez and Juan José Montellano

Discussiones Mathematicae Graph Theory 29 (2009) 469-480.

Abstract. We present several results concerning the Laborde-Payan-Xuang conjecture stating that in every digraph there exists an independent set of vertices intersecting every longest path. The digraphs we consider are defined in terms of local semicompleteness and local transitivity. We also look at oriented graphs for which the length of a longest path does not exceed 4.

transverals
Click on the figure to download the paper in pdf format.