Interlace polynomials for multimatroids and delta-matroids

From MaRDI portal
Publication:402472

DOI10.1016/J.EJC.2014.03.005zbMATH Open1300.05051arXiv1010.4678OpenAlexW2075373454MaRDI QIDQ402472FDOQ402472


Authors: Robert Brijder, Hendrik Jan Hoogeboom Edit this on Wikidata


Publication date: 28 August 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally for multimatroids and delta-matroids. Using combinatorial properties of multimatroids rather than graph-theoretical arguments, we find that various known results about these polynomials, including their recursive relations, are both more efficiently and more generally obtained. In addition, we obtain several interrelationships and results for polynomials on multimatroids and delta-matroids that correspond to new interrelationships and results for the corresponding graphs polynomials. As a tool we prove the equivalence of tight 3-matroids and delta-matroids closed under the operations of twist and loop complementation, called vf-safe delta-matroids. This result is of independent interest and related to the equivalence between tight 2-matroids and even delta-matroids observed by Bouchet.


Full work available at URL: https://arxiv.org/abs/1010.4678




Recommendations




Cites Work


Cited In (25)





This page was built for publication: Interlace polynomials for multimatroids and delta-matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402472)