Packing of two digraphs into a transitive tournament (Q868371)
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 5130458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing of two digraphs into a transitive tournament |
scientific article; zbMATH DE number 5130458 |
Statements
Packing of two digraphs into a transitive tournament (English)
0 references
2 March 2007
0 references
It can be shown that if the number of arcs in a digraph of order \(n\) without directed cycles is sufficiently small, not greater than \(3(n - 1)/4\), then two copies of this digraph are packable into a transitive tournament. The paper presents a generalization of this result by showing that if the sum of the sizes of two digraphs of order \(n\) without directed cycles is not greater than \(3(n - 1)/2\), then these two digraphs are packable into a transitive tournament.
0 references
0.8777804374694824
0 references
0.8666396737098694
0 references
0.8034807443618774
0 references
0.7897664904594421
0 references
