[go: nahoru, domu]

Tournament (graph theory): Difference between revisions

Content deleted Content added
m Ce
m Ce
 
Line 11:
Many of the important properties of tournaments were investigated by [[H. G. Landau]] in 1953 to model dominance relations in flocks of chickens.{{sfnp|Landau|1953}} Tournaments are also heavily studied in [[social choice theory|voting theory]], where they can represent partial information about voter preferences among multiple candidates, and are central to the definition of [[Condorcet methods]].
 
If every player beats the same number of other players ([[Copeland score|indegree − outdegree]] ''= 0'') the tournament is called ''regular''.
 
== Paths and cycles ==