Publication Date



In this note, we provide a sharp upper bound on the rainbow connection number of tournaments of diameter 2. For a tournament Τ of diameter 2, we show 2 ≤ → rc (Τ) ≤ 3. Furthermore, we provide a general upper bound on the rainbow κ-connection number of tournaments as a simple example of the probabilistic method. Finally, we show that an edge-colored tournament of κthdiameter 2 has rainbow κ-connection number at most approximately κ2.

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

ref_tag2014010102.pdf (104 kB)
Supplemental Reference List with DOIs