Home / Series / Discrete Mathematics / Aired Order / Season 1 / Episode 19

Tournaments and King Chickens

Discover some interesting properties of tournaments that arise in sports and other competitions. Represented as a graph, a tournament must contain a Hamiltonian path that visits each vertex once; and at least one "king chicken" competitor who has either beaten every opponent or beaten someone who beat that opponent.

English
  • Runtime 30 minutes
  • Created November 3, 2010 by
    Administrator admin
  • Modified November 3, 2010 by
    Administrator admin