| Display title | Tournament (graph theory) |
| Default sort key | Tournament (Graph Theory) |
| Page length (in bytes) | 17,329 |
| Namespace ID | 0 |
| Page ID | 213084 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>S.Timg |
| Date of page creation | 17:05, 30 June 2023 |
| Latest editor | imported>S.Timg |
| Date of latest edit | 17:05, 30 June 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | A tournament is a directed graph (digraph) obtained by assigning a direction for each edge in an undirected complete graph. That is, it is an orientation of a complete graph, or equivalently a directed graph in which every pair of distinct vertices is connected by a directed edge (often, called an arc... |
