Abstract
In this paper, we survey some recent developments on statistical properties of matchings of very large and infinite graphs. We discuss extremal graph theoretic results like Schrijver’s theorem on the number of perfect matchings of regular bipartite graphs and its variants from the point of view of graph limit theory. We also study the number of matchings of finite and infinite vertex-transitive graphs.
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.
