Limit Shape of Perfect Matchings on Contracting Bipartite Graphs

DOI10.1093/IMRN/RNAB005MaRDI QIDQ5082299zbMATH OpenOpenAlexFDO

Authors

Publication date 16 June 2022

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.10161

Mathematics Subject Classification ID

Combinatorics (05-XX) Statistical mechanics, structure of matter (82-XX)

Recommendations

• scientific article; zbMATH DE number 3987
• On the number of perfect matchings for some certain types of bipartite graphs
• On the uniqueness of perfect matchings in bipartite graphs
• On the number of perfect matchings in a bipartite graph
• On the upper bounds of the numbers of perfect matchings in graphs with given parameters
• A note on the number of perfect matchings of bipartite graphs
• scientific article; zbMATH DE number 3987326
• On the sets of perfect matchings for two bipartite graphs
• A compactness result for perfect matchings

Cited in

(3)

• Asymptotics of pure dimer coverings on rail yard graphs
• Limit shape of perfect matchings on contracting bipartite graphs
• Fluctuations of dimer heights on contracting square-hexagon lattices

This page was built for publication: Limit Shape of Perfect Matchings on Contracting Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082299)