Spanning local tournaments in locally semicomplete digraphs (Q1372735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1088858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning local tournaments in locally semicomplete digraphs |
scientific article; zbMATH DE number 1088858 |
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
0.905009627342224
0 references
0.8311092257499695
0 references
0.8285993933677673
0 references
0.8273038268089294
0 references
0.8229860067367554
0 references
