Orienting transversals and transition polynomials of multimatroids
From MaRDI portal
(Redirected from Publication:679544)
Abstract: Multimatroids generalize matroids, delta-matroids, and isotropic systems, and transition polynomials of multimatroids subsume various polynomials for these latter combinatorial structures, such as the interlace polynomial and the Tutte-Martin polynomial. We prove evaluations of the Tutte-Martin polynomial of isotropic systems from Bouchet directly and more efficiently in the context of transition polynomials of multimatroids. Moreover, we generalize some related evaluations of the transition polynomial of 4-regular graphs from Jaeger to multimatroids. These evaluations are obtained in a uniform and matroid-theoretic way. We also translate the evaluations in terms of the interlace polynomial of graphs. Finally, we give an excluded-minor theorem for the class of binary tight 3-matroids (a subclass of multimatroids) based on the excluded-minor theorem for the class of binary delta-matroids from Bouchet.
Recommendations
Cites work
- 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 5873618 (Why is no real title available?)
- A Penrose polynomial for embedded graphs
- A bracket polynomial for graphs. I
- A polynomial of graphs on surfaces
- Bicycle dimension and special points of the Tutte polynomial
- Binary matroids and local complementation
- Graph polynomials derived from Tutte-Martin polynomials
- Greedy algorithm and symmetric matroids
- Interlace polynomials
- Interlace polynomials for multimatroids and delta-matroids
- Isotropic matroids. I: Multimatroids and neighborhoods
- Isotropic systems
- Le Polynôme De Martin D'un Graphe Eulerien
- 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
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- Recombination faults in gene assembly in ciliates modeled using multimatroids
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- The Forbidden Minors of Binary Clutters
- 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 transition matroid of a 4-regular graph: an introduction
- Tutte-Martin polynomials and orienting vectors of isotropic systems
Cited in
(8)- Transition polynomials
- Multimatroids. III: Tightness and fundamental graphs
- scientific article; zbMATH DE number 5558258 (Why is no real title available?)
- Interlace polynomials for multimatroids and delta-matroids
- The excluded 3-minors for vf-safe delta-matroids
- A characterization of circle graphs in terms of multimatroid representations
- Isotropic matroids. I: Multimatroids and neighborhoods
- The transition matroid of a 4-regular graph: an introduction
This page was built for publication: Orienting transversals and transition polynomials of multimatroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679544)