AbstractThis paper develops a theory of Tutte invariants for 2-polymatroids that parallels the corresponding theory for matroids. It is shown that such 2-polymatroid Invariants arise in the enumeration of a wide variety of combinatorial structures including matchings and perfect matchings in graphs, weak colourings in hypergraphs, and common bases in pairs of matroids. The main result characterizes all such invariants proving that, with some trivial exceptions, every 2-polymatroid Tutte invariant can be easily expressed in terms of a certain two-variable polynomial that is closely related to the Tutte polynomial of a matroid
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
Tutte\u27s wheels-and-whirls theorem is a basic inductive tool for dealing with 3- connected matroid...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
The number of homomorphisms from a finite graph F to the complete graph Kn is the evaluation of the ...
Let M be a matroid representable over GF(q), and let t(M, x, y) denote its Tutte polynomial. We pres...
We define and study semimatroids, a class of objects which abstracts the dependence properties of an...
AbstractFix two lattice paths P and Q from (0,0) to (m,r) that use East and North steps with P never...
We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag v...
We begin by introducing matroids in the context of finite collections of vectors from a vector space...
Many important invariants for matroids and polymatroids are valuations (or are valuative), which is ...
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...
Tutte\u27s wheels-and-whirls theorem is a basic inductive tool for dealing with 3- connected matroid...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
The number of homomorphisms from a finite graph F to the complete graph Kn is the evaluation of the ...
Let M be a matroid representable over GF(q), and let t(M, x, y) denote its Tutte polynomial. We pres...
We define and study semimatroids, a class of objects which abstracts the dependence properties of an...
AbstractFix two lattice paths P and Q from (0,0) to (m,r) that use East and North steps with P never...
We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag v...
We begin by introducing matroids in the context of finite collections of vectors from a vector space...
Many important invariants for matroids and polymatroids are valuations (or are valuative), which is ...
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...
Tutte\u27s wheels-and-whirls theorem is a basic inductive tool for dealing with 3- connected matroid...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....