Spanning local tournaments in locally semicomplete digraphs (Q1372735): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:07, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Spanning local tournaments in locally semicomplete digraphs |
scientific article |
Statements
Spanning local tournaments in locally semicomplete digraphs (English)
0 references
18 November 1997
0 references
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.
0 references
digraph
0 references
connected spanning local tournament
0 references