{
  "aliases": [
    "directed-complete-graph",
    "tournament-mathematics",
    "tournament-graph",
    "transitive-tournament"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn 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]].\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "directed-complete-graph",
      "tournament-mathematics",
      "tournament-graph",
      "transitive-tournament"
    ],
    "inventory": [
      "WPR135E666"
    ],
    "kind": "concept",
    "name": "Tournament (graph theory)",
    "same_as": {
      "wikidata": "Q1320634",
      "wikipedia": "Tournament (graph theory)"
    },
    "sources": [
      {
        "locator": "Tournament (graph theory)",
        "mention": "wikipedia://en/1427502",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:1427502@r1372005031"
      }
    ],
    "tag": "M2F9TN9MW5"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/M2F9TN9MW5/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/M2F9TN9MW5.md",
  "msc": null,
  "name": "Tournament (graph theory)",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/M2F/M2F9TN9MW5.md",
  "status": null,
  "tag": "M2F9TN9MW5",
  "uri": "m2://M2F9TN9MW5",
  "url": "https://math2.tamnd.com/wiki/tournament-graph-theory/",
  "writing": {
    "tag": "M2F9TN9MW5",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}