Some bounds on the uniquely restricted matching number
Combinatorics
2018-04-30 v2
Abstract
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.
Keywords
Cite
@article{arxiv.1803.11032,
title = {Some bounds on the uniquely restricted matching number},
author = {M. Fürst and D. Rautenbach},
journal= {arXiv preprint arXiv:1803.11032},
year = {2018}
}