Read on Wikipedia

Image: Booyabazooka · Public domain

Tournament (graph theory)

Tournament (graph theory)

Directed graph where each vertex pair has one arc.

Rare
37 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

RareTop 25%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 1,025

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 210 clicks on its links

  1. Strongly connected component

    Partition of a graph whose components are reachable from all vertices.

    26%

  2. Tournament solution

    24%

  3. Hamiltonian path

    Path in a graph that visits each vertex exactly once.

    16%

  4. Round-robin tournament

    Type of sports competition.

    12%

  5. Orientation (graph theory)

    Assigning directions to the edges of an undirected graph.

    12%

  6. Sumner's conjecture

    Unsolved problem in graph theory.

    4.8%

Readers come from

Share of the 335 readers arriving from another article

  1. Hamiltonian path

    Path in a graph that visits each vertex exactly once.

    29%

  2. Round-robin tournament

    Type of sports competition.

    19%

  3. Directed graph

    Graph with oriented edges.

    13%

  4. Paley graph

    Graph of numbers differing by a square.

    8.1%

  5. Hadamard matrix

    Mathematics concept.

    3.3%