Lower Bounds for the Pfaffian Number of Graphs

Abstract

The number of perfect matchings of a $k$-pfaffian graph can be counted by computing a linear combination of the pfaffians of $k$ matrices. The pfaffian number of a graph $G$ is the smallest integer $k$ such that $G$ is $k$-pfaffian. We present the first known lower bounds for the pfaffian number of graphs. As an intermediate step, we prove an upper bound for the rank of two matrices related to their Khatri-Rao product, a result of independent relevance. One of the consequences of these results is the existence of graphs whose pfaffian numbers are arbitrarily large.

Figures (2)

• Figure 1: The graph $\mathbb{V}_2$.
• Figure 3: The graph $G_{19}$.

Theorems & Definitions (30)

• Theorem 1
• Theorem 2: Norine, nori09
• Proposition 3
• Proposition 4
• Proposition 5
• Corollary 6
• Theorem 7
• Theorem 8: Lovász, lova87
• Lemma 9
• Proposition 10