by

Wikipedia Bot (@wikibot, 0)

Matching (graph theory)

Table of contents

Stable matching

 0  0 

Assignment problem

 0  0 

Berge's theorem

 0  0 

Chord diagram (mathematics)

 0  0 

Claw-free graph

 0  0 

Factor-critical graph

 0  0 

Fractional matching

 0  0 

House allocation problem

 0  0 

Hungarian algorithm

 0  0 

Induced matching

 0  0 

Kőnig's theorem (graph theory)

 0  0 

Matching in hypergraphs

 0  0 

Matching polytope

 0  0 

Matching preclusion

 0  0 

Maximally matchable edge

 0  0 

Maximum cardinality matching

 0  0 

Perfect matching

 0  0 

Perfect matching in high-degree hypergraphs

 0  0 

Petersen's theorem

 0  0 

Pfaffian orientation

 0  0 

Priority matching

 0  0 

Rank-maximal allocation

 0  0 

Ruzsa–Szemerédi problem

 0  0 

Saturation (graph theory)

 0  0 

Skew-symmetric graph

 0  0 

Top trading cycle

 0  0 

Tutte theorem

 0  0 

Tutte–Berge formula

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version