Abstract
In this paper, we determine the maximum size of a graph of fixed order without isolated vertices which contains (fractional) matching of given size, which is a variation of some known results involving the maximum size of all graphs of fixed order containing matching of given size by Erdős and Gallai. As corollaries of our results, Turán-type results for a connected graph on (fractional) matching are obtained.
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.
