The maximum Pfaffian number over graphs of genus at most g is at least (8/3)^g, improving prior linear lower bounds to exponential for bipartite and complete graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exponential Lower Bounds for the Pfaffian Number of Graphs
The maximum Pfaffian number over graphs of genus at most g is at least (8/3)^g, improving prior linear lower bounds to exponential for bipartite and complete graphs.