Orienting transversals and transition polynomials of multimatroids

DOI10.1016/J.AAM.2017.07.001zbMATH Open1386.05025arXiv1605.04244OpenAlexW3101343723MaRDI QIDQ679544FDOQ679544

Authors: Robert Brijder 

Publication date: 11 January 2018

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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.

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

Recommendations

• Interlace polynomials for multimatroids and delta-matroids
• Multimatroids. II: Orthogonality, minors and connectivity
• Multimatroids. III: Tightness and fundamental graphs
• Transition polynomials
• Tutte-Martin polynomials and orienting vectors of isotropic systems

zbMATH Keywords

matroidTutte polynomial4-regular graphinterlace polynomialisotropic systemmultimatroidtransition polynomial

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the evaluation at (3,3) of the Tutte polynomial of a graph
• A polynomial of graphs on surfaces
• A bracket polynomial for graphs. I
• Le Polynôme De Martin D'un Graphe Eulerien
• The group structure of pivot and loop complementation on graphs and set systems
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
• Title not available (Why is that?)
• Greedy algorithm and symmetric matroids
• The interlace polynomial of graphs at \(-1\)
• Isotropic systems
• Tutte-Martin polynomials and orienting vectors of isotropic systems
• Multimatroids. II: Orthogonality, minors and connectivity
• Interlace polynomials
• Bicycle dimension and special points of the Tutte polynomial
• Graph polynomials derived from Tutte-Martin polynomials
• Title not available (Why is that?)
• Interlace polynomials for multimatroids and delta-matroids
• Multimatroids I. Coverings by Independent Sets
• Nullity and Loop Complementation for Delta-Matroids
• Multimatroids. III: Tightness and fundamental graphs
• The interlace polynomial of a graph
• The Forbidden Minors of Binary Clutters
• Binary matroids and local complementation
• The transition matroid of a 4-regular graph: an introduction
• Isotropic matroids. I: Multimatroids and neighborhoods
• A Penrose polynomial for embedded graphs
• Recombination faults in gene assembly in ciliates modeled using multimatroids

Cited In (6)

• Multimatroids. III: Tightness and fundamental graphs
• A characterization of circle graphs in terms of multimatroid representations
• The excluded 3-minors for vf-safe delta-matroids
• Transition polynomials
• Isotropic matroids. I: Multimatroids and neighborhoods
• Title not available (Why is that?)

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)