{
  "id": "1805.03334",
  "version": "v1",
  "published": "2018-05-09T00:58:07.000Z",
  "updated": "2018-05-09T00:58:07.000Z",
  "title": "$P$-Matchings in Graphs: A Brief Survey with Some Open Problems",
  "authors": [
    "Todd Fenstermacher",
    "Soumendra Ganguly",
    "Stephen Hedetniemi",
    "Renu Laskar"
  ],
  "comment": "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)",
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-05-09T00:58:07.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "open problems",
      "brief survey",
      "independent edges",
      "graph theory"
    ],
    "tags": [
      "conference paper"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}