supported by the National Natural Science Foundation of China(Nos.11871256,11371180,11226286)。
Let G be a graph that admits a perfect matching M.A forcing set S for a perfect matching M is a subset of M such that it is contained in no other perfect matchings of G.The cardinality of a forcing set of M with the s...