Related papers: A Novel Approach to Counting Perfect Matchings of …
In this paper, we give inductive sum formulas to calculate the number of diagonally symmetric, and diagonally \& anti-diagonally symmetric domino tilings of Aztec Diamonds. As a byproduct, we also find such a formula for the unrestricted…
We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…
The method of graphical vertex-condensation for enumerating perfect matchings of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003), 267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57) and…
We compute 2-enumerations of certain halved alternating sign matrices. In one case the enumeration equals the number of perfect matchings of a halved Aztec diamond. In the other case the enumeration equals the number of perfect matchings of…
In the last decade there have been many results about special families of graphs whose number of perfect matchings is given by perfect or near perfect powers. In this paper we present an approach that allows proving them in a unified way.…
We consider the problem of counting matchings in planar graphs. While perfect matchings in planar graphs can be counted by a classical polynomial-time algorithm, the problem of counting all matchings (possibly containing unmatched vertices,…
Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC matching…
In this paper, we present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion principle nor tree-decompositions. For any bipartite graph of $2n$ nodes and $\Delta n$ edges such that $\Delta \geq…
We consider several new families of graphs obtained from Aztec rectangle and augmented Aztec rectangle graphs by trimming two opposite corners. We prove that the perfect matchings of these new graphs are enumerated by powers of $2$, $3$,…
In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
We develop a theory of graph algebras over general fields. This is modeled after the theory developed by Freedman, Lov\'asz and Schrijver in [22] for connection matrices, in the study of graph homomorphism functions over real edge weight…
The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph A_n, or more generally calculating the sum of the weights…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
In this work we study a sequence of perfect t-embeddings of uniformly weighted Aztec diamonds. We show that these perfect t-embeddings can be used to prove convergence of gradients of height fluctuations to those of the Gaussian free field.…
In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…
We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in…
Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine…
We study Hamilton cycles and perfect matchings in a uniform attachment graph. In this random graph, vertices are added sequentially, and when a vertex $t$ is created, it makes $k$ independent and uniform choices from $\{1,\dots,t-1\}$ and…