Monochromatic sinks in nearly transitive arc-colored tournaments

Abstract

Let T be the set of all arc-colored tournaments, with any number of colors, that contain no rainbow 3-cycles, i.e., no 3-cycles whose three arcs are colored with three distinct colors. We prove that if T ∈ T and if each strong component of T is a single vertex or isomorphic to an upset tournament, then T contains a monochromatic sink. We also prove that if… (More)
DOI: 10.1016/j.disc.2010.04.003

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.