Some bounds on the uniquely restricted matching number

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.

References in corpus (2)

• Tight lower bounds on the matching number in a graph with given maximum degree
• A lower bound on the acyclic matching number of subcubic graphs