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.
The Merino–Welsh Conjecture for Split Matroids
Ferroni, Luis
;
2022-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
