Some bounds on the uniquely restricted matching number
classification
🧮 math.CO
keywords
matchingrestricteduniquelyboundsmaximumsizecoversdegree
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.