A Hypergraph Tutte Polynomial
Abstract
We introduce a Tutte polynomial for hypergraphs, , together with , a related Tutte polynomial for -polymatroids. Both invariants admit deletion--contraction recursions that remain within their respective classes, and they are linked by the fact that specializes to on the associated polymatroid of any -uniform hypergraph. We show that satisfies several desirable Tutte type properties, including multiplicativity and duality, while further admits a universality theorem, as well as a convolution product formula. In the uniform hypergraph setting, these latter results specialize back to . We also relate to hypergraph extensions of the Potts and random cluster models. In particular, we study degree dependent random cluster and Potts partition functions, as well as Grimmett's many body Potts model, and compare their relationship with in both the general and uniform settings. Finally, we compare with the polymatroid Tutte polynomial of Bernardi, K'alm'an, and Postnikov, showing that the two are incomparable in distinguishing power. As a consequence, we answer negatively a question raised by these authors by proving that the characteristic polynomial is not, in general, a specialization of .
Cite
@article{arxiv.2607.16334,
title = {A Hypergraph Tutte Polynomial},
author = {Khallil Berrekkal and Joanna A. Ellis-Monaghan and Merijn Moody},
journal= {arXiv preprint arXiv:2607.16334},
year = {2026}
}
Comments
37 pages