On heterochromatic out-directed spanning trees in tournaments
Combinatorics
2016-01-19 v1
Abstract
Given a tournament T, let h(T) be the smallest integer k such that every arc-coloring of T with k or more colors produces at least one out-directed spanning tree of T with no pair of arcs with the same color. In this paper we give the exact value of h(T).
Keywords
Cite
@article{arxiv.1601.04170,
title = {On heterochromatic out-directed spanning trees in tournaments},
author = {Juan José Montellano-Ballesteros and Eduardo Rivera Campo},
journal= {arXiv preprint arXiv:1601.04170},
year = {2016}
}