Spanning local tournaments in locally semicomplete digraphs

https://doi.org/10.1016/S0166-218X(97)00037-1Get rights and content
Under an Elsevier user license
open archive

Abstract

We investigate the existence of a spanning local tournament with possibly high connectivity in a highly connected locally semicomplete digraph. It is shown that every (3k − 2)-connected locally semicomplete digraph contains a k-connected spanning local tournament. This improves the result of Bang-Jensen and Thomassen for semicomplete digraphs and of Bang-Jensen [1] for locally semicomplete digraphs.

Keywords

Digraph
Connectivity

Cited by (0)

This paper forms a part of the author's Ph.D. Thesis [2] written under the supervision of Professor L. Volkmann al RWTH Aachen.

1

The author is supported by a postdoctoral grant from “Deutsche Forschungsgemeinschaft” as a member of the “Graduiertenkolleg: Analyse und Konstruktion in der Mathematik” at RWTH Aachen.