Let T be a tournament with edges colored with any number of colors. A rainbow triangle is a 3-colored 3-cycle. A monochromatic sink of T is a vertex which can be reached along a monochromatic path by every other vertex of T. In 1982, Sands, Sauer, and Woodrow asked if T has no rainbow triangles, then does T have a monochromatic sink?
Download count: 0
- Partial requirement for: Ph.D., Arizona State University, 2011Note typethesis
- Includes bibliographical references (p
- Field of study: Mathematics