On heterochromatic out-directed spanning trees in tournaments
classification
🧮 math.CO
keywords
out-directedspanningarc-coloringarcscolorcolorseveryexact
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.