Read on Wikipedia

Image: David Eppstein · Public domain

Kőnig's theorem (graph theory)

Kőnig's theorem (graph theory)

On bipartite matching and vertex cover.

Super rare
88 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

Super rareTop 12%

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 2,052

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 726 clicks on its links

  1. Vertex cover

    Subset of a graph's vertices, including at least one endpoint of every edge.

    25%

  2. Dénes Kőnig

    Hungarian mathematician (1884–1944).

    23%

  3. Maximum-cardinality matching

    Graph theory problem: find a matching containing the most edges.

    17%

  4. Bipartite graph

    Graph divided into two independent sets.

    4.5%

  5. Hall's marriage theorem

    Result in combinatorics and graph theory.

    4.3%

  6. Matching in hypergraphs

    Set of hyperedges where every pair is disjoint.

    1.5%

  7. Kőnig's lemma

    Mathematical result on infinite trees.

    1.4%

Readers come from

Share of the 675 readers arriving from another article

  1. Hall's marriage theorem

    Result in combinatorics and graph theory.

    16%

  2. Bipartite graph

    Graph divided into two independent sets.

    11%

  3. Vertex cover

    Subset of a graph's vertices, including at least one endpoint of every edge.

    9.2%

  4. Independent set (graph theory)

    Unrelated vertices in graphs.

    1.9%

  5. Dénes Kőnig

    Hungarian mathematician (1884–1944).

    1.5%