---
tag: M2F9TN9MW5
kind: concept
name: Tournament (graph theory)
aliases: [directed-complete-graph, tournament-mathematics, tournament-graph, transitive-tournament]
sources:
  - wikipedia: en:1427502@r1372005031
    locator: Tournament (graph theory)
    note: adopted
    mention: wikipedia://en/1427502
    sections: [Summary]
same_as:
  wikidata: Q1320634
  wikipedia: Tournament (graph theory)
inventory: [WPR135E666]
---

## Summary

In graph theory, a **tournament** is a [[directed graph|0KFYGSHHF5]] with exactly one edge between each two vertices, in one of the two possible directions. Equivalently, a tournament is an orientation of an [[undirected complete graph|03WKB2H474]]. (However, as directed graphs, tournaments are not complete: complete directed graphs have two edges, in both directions, between each two vertices.) Equivalently, a tournament is a [[complete|NJ13KN813B]] asymmetric [[relation|05AVARPXA2]].