AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polynomialTM(x,y) which generalizes many of its known interpretations and specializations, including Tutte's coloring and flow interpretations ofTM(1−t,0),TM(0,−t); Crapo and Rota's finite field interpretation ofTM(1−qk,0); the interpretation in terms of the Whitneycorank-nullitypolynomial; Greene's interpretation as the weight enumerator of a linear code and its recent generalization to higher weight enumerators by Barg; Jaeger's interpretation in terms of linear code words and dual code words with disjoint support; and Brylawksi and Oxley's two-variable coloring formula
Using matroid duality and the critical problem, we show that certain evaluations of the Tutte polyno...
AMS Subject Classication: 05B35, 05C10 Abstract. Using matroid duality and the critical problem, we ...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polyn...
AbstractGiven a matroid M and its Tutte polynomial TM(x,y), TM(0,1) is an invariant of M with variou...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, a...
We consider a specialization YM (q; t) of the Tutte polynomial of a matroid M which is inspired by a...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
Neste trabalho apresentamos algumas relações entre matróides e códigos lineares. Estudamos vários i...
AbstractWe give a general convolution–multiplication identity for the multivariate and bivariate ran...
Let M be a matroid representable over GF(q), and let t(M, x, y) denote its Tutte polynomial. We pres...
Using matroid duality and the critical problem, we show that certain evaluations of the Tutte polyno...
AMS Subject Classication: 05B35, 05C10 Abstract. Using matroid duality and the critical problem, we ...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polyn...
AbstractGiven a matroid M and its Tutte polynomial TM(x,y), TM(0,1) is an invariant of M with variou...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, a...
We consider a specialization YM (q; t) of the Tutte polynomial of a matroid M which is inspired by a...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
Neste trabalho apresentamos algumas relações entre matróides e códigos lineares. Estudamos vários i...
AbstractWe give a general convolution–multiplication identity for the multivariate and bivariate ran...
Let M be a matroid representable over GF(q), and let t(M, x, y) denote its Tutte polynomial. We pres...
Using matroid duality and the critical problem, we show that certain evaluations of the Tutte polyno...
AMS Subject Classication: 05B35, 05C10 Abstract. Using matroid duality and the critical problem, we ...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...