Abstract
Let T be a tournament on n vertices whose arcs are colored with k colors. A 3-cycle whose arcs are colored with three distinct colors is called a rainbow triangle. A rainbow triangle dominated by any nonempty set of vertices is called a dominated rainbow triangle. We prove that when \(n\ge 5\), if T does not contain a dominated rainbow triangle and all 4- and 5-cycles of T are near-monochromatic, then T has a monochromatic sink. We also prove that when \(n\ge 4\), if T does not contain a dominated rainbow triangle and all 4-cycles are monochromatic, then T has a monochromatic sink. A semi-cycle is a digraph C that either is a cycle or contains an arc xy such that \(C-xy+yx\) is a cycle. We prove that if \(n\ge 4\) and all 4-semi-cycles of T are near-monochromatic, then T has a monochromatic sink. We also show if \(n\ge 5\) and all 5-semi-cycles of T are near-monochromatic, then T has a monochromatic sink.
Similar content being viewed by others
References
Galeana-Sánchez, H.: On monochromatic paths and monochromatic cycles in edge coloured tournaments. Discrete Math. 156, 103–112 (1996)
Galeana-Sánchez, H., Rojas-Monroy, R.: A counterexample to a conjecture on edge-coloured tournaments. Discrete Math. 282, 275–276 (2004)
Galeana-Sánchez, H., Rojas-Monroy, R.: Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments. Graphs Comb. 21, 307–317 (2005)
Melcher, M., Reid, K.B.: Monochromatic sinks in nearly transitive arc-colored tournaments. Discrete Math. 310, 2697–2704 (2010)
Rédei, L.: Ein kombinatorischer Satz. Acta Litt. Szeged. 7, 39–43 (1934)
Sands, B., Sauer, N., Woodrow, R.: On monochromatic paths in edge-coloured digraphs. J. Comb. Theory Ser. B 33, 271–275 (1982)
Shen, M.G.: On monochromatic paths in m-colored tournaments. J. Comb. Theory Ser. B 45, 108–111 (1988)
Acknowledgments
The author wishes to thank H.A. Kierstead for providing a significant amount of guidance and help through the course of developing the results found in this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bland, A. Monochromatic Sinks in k-Arc Colored Tournaments. Graphs and Combinatorics 32, 1279–1291 (2016). https://doi.org/10.1007/s00373-015-1659-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-015-1659-6