A deletion-contraction formula and monotonicity properties for the polymatroid Tutte polynomial
Xiaxia Guan, Xian'an Jin, Tam\'as K\'alm\'an

TL;DR
This paper extends the Tutte polynomial to polymatroids, providing a deletion-contraction formula, proving monotonicity properties for certain polynomials, and characterizing hypergraphs with maximal polynomial coefficients.
Contribution
It introduces a deletion-contraction formula for the polymatroid Tutte polynomial and establishes new monotonicity properties for interior and exterior polynomials.
Findings
Deletion-contraction formula for $\
Monotonicity properties for interior and exterior polynomials, but not for the Tutte polynomial itself.
Characterization of hypergraphs with maximal coefficients in the exterior polynomial.
Abstract
The Tutte polynomial is a crucial invariant of matroids. The polymatroid Tutte polynomial , introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids . In this paper, we first obtain a deletion-contraction formula for . Then we prove two natural monotonicity properties, for containment and for minors of the interior polynomial and the exterior polynomial , for polymatroids over . We show by a counter-example that these monotonicity properties do not extend to . Using deletion-contraction, we obtain formulas for the coefficients of terms of degree in . Finally, for all , we characterize hypergraphs so that the coefficient of in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Graph Theory Research
