Abstract
Given a graph G, the matching number of G, written α′(G), is the maximum size of a matching in G, and the fractional matching number of G, written αf′(G), is the maximum size of a fractional matching of G. In this paper, we prove that if G is an n-vertex connected graph that is neither K1 nor K3, then αf′(G)−α′(G)≤n−26 and αf′(G)α′(G)≤3n2n+2. Both inequalities are sharp, and we characterize the infinite family of graphs where equalities hold.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
