Category

Matching (graph theory)

page 1

set of edges without common vertices

Hungarian algorithm

combinatorial optimization algorithm for the assignment problem

Hall's marriage theorem

theorem that a finite bipartite graph has a perfect matching iff any subset of vertices from one group has a neighbourhood of equal or greater size

secretary problem

mathematical problem

transportation theory

the mathematical study of optimal transportation and allocation of resources

König's theorem

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

Hopcroft–Karp algorithm

algorithm for maximum cardinality matching in bipartite graphs

theorem giving a necessary and sufficient condition for a perfect matching to exist on a graph; generalization of Hall's marriage theorem

assignment problem

combinatorial optimization problem

theorem in graph theory

Geometric construct

blossom algorithm

algorithm for constructing maximum matchings on a graph

3-dimensional matching

Concept in mathematical graph theory

claw-free graph

graph without four-vertex star induced subgraph

Petersen's theorem

every cubic bridgeless graph has a perfect matching