Basics of stable matching

Introduction to Graph Matching

Given a graph G(V,E), a matching is a subgraph in G if each vertex has a degree one. No edge shares a vertex with another edge.

Size of a matching

Size of a matching is equal is to the number of edges present in the matching.

Perfect Matching

A matching is called perfect if it contains all the vertices present in the graph. Perfect matching is also known as Complete matching.

Bipartite graphs

A bipartite graph is a graph whose vertices can be divided into
two disjo...