Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy

From MaRDI portal

(Redirected from Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Lower_Bounds_for_Partial_Matchings_in_Regular_Bipartite_Graphs_and_Applications_to_the_Monomer–Dimer_Entropy&oldid=80850698"