The Merino-Welsh conjecture for split matroids
From MaRDI portal
Abstract: In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by exploiting the structure of their lattice of cyclic flats. This class of matroids strictly contains all paving and copaving matroids.
Recommendations
Cites work
- A Tutte polynomial inequality for lattice path matroids
- An extremal problem for non-separable matroids
- An inequality for Tutte polynomials
- Comparing the number of acyclic and totally cyclic orientations with that of spanning trees of a graph
- Excluded minors for the class of split matroids
- Forests, colorings and acyclic orientations of the square lattice
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Hypergraph characterization of split matroids
- Matroids from hypersimplex splits
- On the asymptotic proportion of connected matroids
- On the Ehrhart polynomial of minimal matroids
- Some inequalities for the Tutte polynomial
- Spanning trees and orientation of graphs
- The lattice of cyclic flats of a matroid
- The Merino-Welsh conjecture holds for series-parallel graphs
Cited in
(6)
This page was built for publication: The Merino-Welsh conjecture for split matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065691)