Category:Matching (graph theory)

• Matching (graph theory)

0–9

• 1-factor
• 3-dimensional matching

A

• Assignment problem

B

• Berge's theorem
• Blossom algorithm

C

• Chord diagram (mathematics)
• Claw-free graph

D

• Domino tiling
• Dulmage–Mendelsohn decomposition

F

• Factor-critical graph
• Fractional matching

G

• Gallai–Edmonds decomposition

H

• Hafnian
• Hall-type theorems for hypergraphs
• Hall's marriage theorem
• Hopcroft–Karp algorithm
• Hosoya index
• House allocation problem
• Hungarian algorithm

I

• Induced matching

K

• Kőnig's theorem (graph theory)

M

• Matching in hypergraphs
• Matching polynomial
• Matching polytope
• Matching preclusion
• Maximally matchable edge
• Maximum cardinality matching

P

• Partition matroid
• Perfect matching
• Perfect matching in high-degree hypergraphs
• Petersen's theorem
• Pfaffian orientation
• Priority matching

Q

• Quantum dimer models

R

• Random two-sided matching
• Rank-maximal allocation
• Ruzsa–Szemerédi problem

S

• Saturation (graph theory)
• Secretary problem
• Skew-symmetric graph

T

• Telephone number (mathematics)
• Top trading cycle
• Transportation theory (mathematics)
• Tutte matrix
• Tutte theorem
• Tutte–Berge formula

W

• Weapon target assignment problem