On heterochromatic out-directed spanning trees in tournaments (Q5964994): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2077622683 / rank | |||
Normal rank |
Revision as of 20:59, 19 March 2024
scientific article; zbMATH DE number 6548092
Language | Label | Description | Also known as |
---|---|---|---|
English | On heterochromatic out-directed spanning trees in tournaments |
scientific article; zbMATH DE number 6548092 |
Statements
On heterochromatic out-directed spanning trees in tournaments (English)
0 references
2 March 2016
0 references
A tournament is a digraph \(D\) such that for every pair of vertices \(x\) and \(y\), the arc \((x, y)\) or \((y, x)\) is in \(D\), but not both. The purpose of the paper is to determine the smallest integer \(k\) such that every arc-coloring of a tournament \(T\) with \(k\) or more colors produces at least one out-directed spanning tree \(t\) of \(T\) with no pair of arcs with the same color, where \(t\) is a tree with root vertex \(r\) such that for each vertex \(u\), the unique path between \(u\) and \(r\) of \(t\) is directed from \(r\) to \(u\).
0 references
out-directed tree
0 references
tournament
0 references
heterochromatic subgraphs
0 references