Abstract
For a simple graph G, let be the size of a matching drawn uniformly at random from the set of all matchings of G. Motivated by work of C. Godsil [11], we give, for a sequence and , several necessary and sufficient conditions for asymptotic normality of the distribution of , for instance (where E and is the size of a largest matching in ). In particular this gives asymptotic normality for any sequence of regular graphs (of positive degree) or graphs with perfect matchings. When tends to a finite limit, a sufficient (and probably necessary) condition is given for to be asymptotically Poisson. The material presented here suggests numerous related questions, some of which are discussed in the last section of the paper.
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.
