# zbMATH — the first resource for mathematics

Spanning local tournaments in locally semicomplete digraphs. (English) Zbl 0884.05047
A subgraph of a graph is a spanning subgraph if it contains all the vertices of the graph. A digraph is semicomplete if there is at least one arc between any two different vertices. The author proves that every $$3k-2$$ connected locally semicomplete digraph contains a $$k$$ connected spanning local tournament.

##### MSC:
 05C20 Directed graphs (digraphs), tournaments 05C40 Connectivity
##### Keywords:
digraph; connected spanning local tournament
Full Text:
##### References:
 [1] Bang-Jensen, J., Locally semicomplete digraphs: a generalization of tournaments, J. graph theory, 14, 371-390, (1990) · Zbl 0703.05026 [2] Y. Guo, Locally Semicomplete Digraphs, Ph.D. Thesis, RWTH Aachen, Germany. · Zbl 0831.05034 [3] Guo, Y.; Volkmann, L., Connectivity properties of locally semicomplete digraphs, J. graph theory, 18, 269-280, (1994) · Zbl 0830.05043
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.