Abstract
The method of graphical condensation for enumerating perfect matchings was found by Propp (Theoret. Comput. Sci. 303 (2003) 267), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004) 29). In this paper, we obtain some more general results on graphical condensation than Kuo's. Our method is also different from Kuo's. As applications of our results, we obtain a new proof of Stanley's multivariate version of the Aztec diamond theorem and we enumerate perfect matchings of a type of molecular graph. Finally, a combinatorial identity on the number of plane partitions is also given.
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.
