Description

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

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?

Reuse Permissions
  • 340.03 KB application/pdf

    Download count: 0

    Details

    Contributors
    Date Created
    • 2011
    Resource Type
  • Text
  • Collections this item is in
    Note
    • Partial requirement for: Ph.D., Arizona State University, 2011
      Note type
      thesis
    • Includes bibliographical references (p
    • Field of study: Mathematics

    Citation and reuse

    Statement of Responsibility

    by Adam K. Bland

    Machine-readable links