In graph theory, a perfect matching in a graph is a matching that covers every vertex of the graph. More formally, given a graph , a perfect matching in is a subset of edge set , such that every vertex in the vertex set is adjacent to exactly one edge in .
In gRapH TheOrY a PeRfect matchIng iN a grApH is a maTcHiNG tHAT coVERs eVery vERtex of THe graph moRe fOrmaLlY gIVen A grAph  a Perfect mAtchiNG In is a SUbsEt of eDge set  suCh thAt eveRy vErtEx in the Vertex set iS aDjaCEnt To exActlY oNE edgE in 