Linked from

The 19 pages that link to Matching (graph theory), each with the reason it gives.

• Graph theoryRelated: Matching models assignments where each participant can receive at most one partner.

• Bipartite graphRelated: Matchings are central structures studied in bipartite graphs.

• Graph (discrete mathematics)Broader topic: Matchings select compatible pairwise relationships from a graph.

• Edge (graph theory)Related: It selects mutually nonconflicting connections from a graph.

• Edge coloringRelated: Each color class in a proper edge coloring is a matching.

• Hall's marriage theoremRelated: A matching covering every set-vertex encodes distinct representatives.

• Line graphRelated: A matching in the original graph is an independent set in its line graph.

• Perfect matchingNarrower topic: A perfect matching is a matching that covers every vertex.

• Odd cycleRelated: Odd cycles complicate the search for maximum matchings in general graphs.

• Kőnig's theoremBroader topic: The theorem's first optimization is to find a matching with as many edges as possible.

• Blossom algorithmNarrower topic: The algorithm enlarges a matching until no larger one exists.

• Matching polynomialNarrower topic: Each coefficient counts matchings of a particular size.

• Maximum-cardinality matchingNarrower topic: A maximum-cardinality matching is a matching chosen to maximize the number of its edges.

• Edge coverRelated: Maximum matchings determine the size and construction of minimum edge covers.

• Hosoya indexNarrower topic: The Hosoya index counts every matching, from the empty set to the largest ones.

• Dinitz theoremRelated: The proof repeatedly uses matchings to assign colors without conflicts.

• Goldberg–Seymour conjectureRelated: Each color class in a proper edge coloring is a matching.

• Stable matching problemNarrower topic: Stable matching adds a preference-based condition to this basic assignment structure.

• Tutte's theorem on perfect matchingsNarrower topic: A perfect matching is a matching that covers every vertex.