1 paper
Ting Yang, Xiying Yuan
The fractional matching number of a graph G, is the maximum size of a fractional matching of G. The following sharp lower bounds for a graph G of order n are proved, and all extrem…