Abstract
In this paper, we study the relationship between forbidden subgraphs and the existence of a matching. Let H be a set of connected graphs, each of which has three or more vertices. A graph G is said to be H -free if no graph in H is an induced subgraph of G. We completely characterize the set H such that every connected H -free graph of sufficiently large even order has a perfect matching in the following cases. (1) Every graph in H is triangle-free. (2) H consists of two graphs (i.e. a pair of forbidden subgraphs). A matching M in a graph of odd order is said to be a near-perfect matching if every vertex of G but one is incident with an edge of M. We also characterize H such that every H -free graph of sufficiently large odd order has a near-perfect matching in the above cases.
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.
