Interlace polynomials for multimatroids and delta-matroids
From MaRDI portal
(Redirected from Publication:402472)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3156382 (Why is no real title available?)
- scientific article; zbMATH DE number 4214039 (Why is no real title available?)
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 1445310 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
- A Tutte Polynomial for Coloured Graphs
- A bracket polynomial for graphs. I
- A generalization of Tutte's characterization of totally unimodular matrices
- A multivariate interlace polynomial and its computation for graphs of bounded clique-width
- A two-variable interlace polynomial
- Bicycle dimension and special points of the Tutte polynomial
- Coverings and delta-coverings
- Graph polynomials and their applications. I: The Tutte polynomial
- Graph polynomials and their applications. II: Interrelations and interpretations
- Graph polynomials derived from Tutte-Martin polynomials
- Interlace polynomials
- Multimatroids I. Coverings by Independent Sets
- Multimatroids. II: Orthogonality, minors and connectivity
- Multimatroids. III: Tightness and fundamental graphs
- Nullity and loop complementation for delta-matroids
- Nullity invariance for pivot and the interlace polynomial
- On the Principal Edge Tripartition of a Graph
- Parametrized Tutte Polynomials of Graphs and Matroids
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Strong Tutte Functions of Matroids and Graphs
- The Penrose polynomial of binary matroids
- The excluded minors for GF(4)-representable matroids
- The group structure of pivot and loop complementation on graphs and set systems
- The interlace polynomial of a graph
- The interlace polynomial of graphs at \(-1\)
- The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
- Tutte-Martin polynomials and orienting vectors of isotropic systems
Cited in
(25)- On the interplay between embedded graphs and delta-matroids
- Multimatroids. III: Tightness and fundamental graphs
- scientific article; zbMATH DE number 4200218 (Why is no real title available?)
- How many delta-matroids are there?
- Transition polynomial as a weight system for binary delta-matroids
- Multimatroids and rational curves with cyclic action
- Delta-matroids whose twist polynomials are monomials
- Signed permutohedra, delta‐matroids, and beyond
- The adjacency matroid of a graph
- Interlacement and activities in delta-matroids
- Orienting transversals and transition polynomials of multimatroids
- The excluded 3-minors for vf-safe delta-matroids
- A characterization of circle graphs in terms of multimatroid representations
- The universal valuation of Coxeter matroids
- Isotropic matroids. I: Multimatroids and neighborhoods
- Inductive tools for connected delta-matroids and multimatroids
- Isotropic matroids. II: Circle graphs
- Matroids, delta-matroids and embedded graphs
- Hopf algebras and Tutte polynomials
- Interlacing networks: birational RSK, the octahedron recurrence, and Schur function identities
- Binary matroids and local complementation
- Twist polynomials of delta-matroids
- The interlace polynomial and the Tutte–Martin polynomial
- K-classes of delta-matroids and equivariant localization
- Recombination faults in gene assembly in ciliates modeled using multimatroids
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)
