arXiv Analytics

Sign in

arXiv:1805.03334 [math.CO]AbstractReferencesReviewsResources

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

Todd Fenstermacher, Soumendra Ganguly, Stephen Hedetniemi, Renu Laskar

Published 2018-05-09Version 1

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.

Comments: 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
Related articles: Most relevant | Search more
arXiv:math/9907050 [math.CO] (Published 1999-07-08)
On some extremal problems in graph theory
arXiv:1301.1408 [math.CO] (Published 2013-01-08)
The McKean-Singer Formula in Graph Theory
arXiv:1904.09657 [math.CO] (Published 2019-04-21)
A result on polynomials derived via graph theory

Links

Toolbox