In graph theory, a tournament is a simple digraph whose underlying graph is complete, ie, a bunch of dots (vertex) with an arrow (arc) connecting each dot to every other dot. This is supposed to represent a tournament (webster's sense) in which each player (dot) plays (is connected to) every other player. The player at the head of the arrow is the loser of that game.

Tour"na*ment (?), n. [OE. turnement, tornement, OF. torneiement, tornoiement, F. tournoiement a turning or wheeling round. See Tourney.]


A mock fight, or warlike game, formerly in great favor, in which a number of combatants were engaged, as an exhibition of their address and bravery; hence, figuratively, a real battle.

"In battle and in tourneyment."


With cruel tournament the squadrons join. Milton.

⇒ It different from the joust, which was a trial of skill between one man and another.


Any contest of skill in which there are many contestents for championship; as, a chess tournament.


© Webster 1913.

Log in or register to write something here or to contact authors.