Metraipolis › archive › dc_c98ca2166db3

Tournament (graph theory) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Tournament_(graph_theory)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T11:39:01.759Z
SHA-256 of the archived text
c1cadacce1c0ee52bc9ecb3d5a6481e766f3d7eb3c6d99bc90a19760ebc6839a
Stable URL of this page
https://metraipolis.com/documento/dc_c98ca2166db3

How to cite

Tournament (graph theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Tournament_(graph_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c98ca2166db3 (Metraipolis archive dc_c98ca2166db3, sha256 c1cadacce1c0ee52bc9ecb3d5a6481e766f3d7eb3c6d99bc90a19760ebc6839a)
BibTeX
@misc{dcc98ca2166db3,
  title = {Tournament (graph theory) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Tournament_(graph_theory)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c98ca2166db3; sha256 c1cadacce1c0ee52bc9ecb3d5a6481e766f3d7eb3c6d99bc90a19760ebc6839a},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Tournament_(graph_theory). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In graph theory, a tournament is a directed graph 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. (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 asymmetric relation. The name tournament comes from interpreting the graph as the outcome of a round-robin tournament, a game where each player is paired against every other exactly once. In a tournament, the vertices represent the players, and the edges between players point from the winner to the loser. Many of the important properties of tournaments were investigated by H. G. Landau in 1953 to model dominance relations in flocks of chickens. Tournaments are also heavily studied in 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 (indegree − outdegree = 0) the tournament is called regular. The number of unlabeled regular tournaments with 2n+1 vertices goes: 1, 1, 1, 3, 15, 1223, 1495297, 18400989629, 2406183070160597,... (sequence A096368 in the OEIS)

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Tournament (graph theory)» — https://en.wikipedia.org/wiki/Tournament_(graph_theory)
Wikidata Q1320634 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1320634
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Tournament_(graph_theory)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1372005031, consultata il 2026-10-07T11:19:02.053Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 55b12ea4557f6194c1f83abdc6f59fd3697e26a660915e6b29775c4086c7e633