Abstract

For a polymatroid P over [n], Bernardi et al. (2022) [1] introduced the polymatroid Tutte polynomial TP relying on the order 1<2<⋯<n of [n], which generalizes the classical Tutte polynomial from matroids to polymatroids. They proved the independence of this order by the fact that TP is equivalent to another polynomial that only depends on P. In this paper, similar to the Tutte's original proof of the well-definedness of the Tutte polynomial defined by the summation over all spanning trees using activities depending on the order of edges, we give a direct and elementary proof of the well-definedness of the polymatroid Tutte polynomial.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.