Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

König's theorem · Vinony

EntityQ897769· pop 13· linked from 33 articles

König's theorem

Sign in to save

theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs

Connections

International Standard Book Number

digital object identifier

linear programming

International Congress of Mathematicians

László Lovász

bipartite graph

time complexity

double acute accent

independent set

Categories

Bipartite graphs Matching (graph theory)Perfect graphs Theorems in graph theory

Sources

wikipedia.externallinksexternallink

What links here33 pages

Hall's marriage theorem

Jenő Egerváry

perfect graph theorem

Max-flow min-cut theorem

bipartite graph

Dilworth's theorem

Menger's theorem

strong perfect graph theorem

doubly stochastic matrix

dual linear program

Hungarian algorithm

independent set

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

bipartite dimension

Entitydist 0.44

Turán's theorem

Entitydist 0.49

Category:Bipartite graphs

Entitydist 0.49

Entitydist 0.50

graph factorization

Entitydist 0.52

Category:Matching (graph theory)

Entitydist 0.53

Erdős–Faber–Lovász conjecture

Entitydist 0.54

Entitydist 0.54

Entitydist 0.55

Hadwiger conjecture

Entitydist 0.56

minimax theorem

Entitydist 0.58

Entitydist 0.61