Twist monomials of binary delta-matroids
A delta-matroid \(D=(E,\mathcal{F})\) is a family of sets obeying an exchange axiom generalizing an axiom of matroids. The authors continue their work on twist polynomials of delta-matroids with this current paper, which characterizes normal binary delta-matroids whose twist polynomials have only one term:\N\NTheorem. [Main Theorem] Let \(D = (E,\mathcal{F})\) be a normal binary delta-matroid. Then \(^{\partial}\omega_D(z) = mz^k\) if and only if each connected component of the intersection graph of \(D\) is either a complete graph of odd order or a single vertex with a loop.
- Counterexamples to a conjecture by Gross, Mansour and Tucker on partial-dual genus polynomials of ribbon graphs
- Delta-matroids for graph theorists
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Greedy algorithm and symmetric matroids
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Log-Concavity of Combinations of Sequences and Applications to Genus Distributions
- Maps and -matroids
- Matroids, delta-matroids and embedded graphs
- On a conjecture of Gross, Mansour and Tucker
- On the interplay between embedded graphs and delta-matroids
- Partial duality for ribbon graphs. I: distributions
- Partial-dual polynomials and signed intersection graphs
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Twist polynomials of delta-matroids
This page was built for publication: Twist monomials of binary delta-matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846888)
