$P$-Matchings in Graphs: A Brief Survey with Some Open Problems

Abstract

For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.

A portion of these results were presented at the 49th SE International Conference on Combinatorics, Graph Theory and Computing, March 5-9, 2018 and will appear in the conference proceedings, Congressus Numerantium (2018)