English

A Hypergraph Tutte Polynomial

Combinatorics 2026-07-16 v1

Abstract

We introduce a Tutte polynomial for hypergraphs, THGT_{\mathrm{HG}}, together with TkT_k, a related Tutte polynomial for kk-polymatroids. Both invariants admit deletion--contraction recursions that remain within their respective classes, and they are linked by the fact that THGT_{\mathrm{HG}} specializes to TkT_k on the associated polymatroid of any (k+1)(k+1)-uniform hypergraph. We show that THGT_{\mathrm{HG}} satisfies several desirable Tutte type properties, including multiplicativity and duality, while TkT_k further admits a universality theorem, as well as a convolution product formula. In the uniform hypergraph setting, these latter results specialize back to THGT_{\mathrm{HG}}. We also relate THGT_{\mathrm{HG}} 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 THGT_{\mathrm{HG}} in both the general and uniform settings. Finally, we compare THGT_{\mathrm{HG}} with the polymatroid Tutte polynomial TP\mathcal{T}_P 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 TP\mathcal{T}_P.

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