PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 17, 20240 citationsOpen Access

A Novel Approach to Counting Perfect Matchings of Graphs

View Full Paper
PPPravakar PaulMSManjil P. Saikia

Key Points

Key points are not available for this paper at this time.

Abstract

We build a new perspective to count perfect matchings of a given graph. This idea is motivated by a construction on the relative cohomology group of surfaces. As an application of our theory, we reprove the celebrated Aztec Diamond theorem, and show how alternating sign matrices naturally arises through this framework.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Paul et al. (2024) studied this question.

synapsesocial.com/papers/68e5be7bb6db643587556601https://doi.org/10.48550/arxiv.2408.10273
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1A Stability Result for Almost Perfect Matchings2026
  2. 2Perfect matchings and spanning trees: squarishness, bijections and independence2024
  3. 3Positive Codegree Thresholds for Perfect Matchings in Hypergraphs2026
  4. 4Matchings of the alternating sign triangle graph2026
  5. 5Colour-bias perfect matchings in hypergraphs2024