Claws in digraphs (Q2473004)
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 5241018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Claws in digraphs |
scientific article; zbMATH DE number 5241018 |
Statements
Claws in digraphs (English)
0 references
26 February 2008
0 references
A rooted tree is a tree with a specified vertex called the root of the tree. An in-branching is an orientation of a rooted tree in which every vertex except the root has out degree 1. A claw is an in-branching in which only the root may have an in degree more than 2. The paper studies the existence of claws in digraph, thereby extending a result of \textit{M. Saks} and \textit{V. T. Sós} [Colloq. Math. Soc. János Bolyai 37, 663--674 (1984; Zbl 0566.05032)] to the tournament-like digraphs.
0 references
digraph
0 references
claw
0 references
tournament
0 references
0 references
0.8046955466270447
0 references
0.7569172978401184
0 references
0.7499311566352844
0 references
0.7432432770729065
0 references
