Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
Journal of Combinatorial Theory Series A
Lattice path matroids: enumerative aspects and Tutte polynomials
Journal of Combinatorial Theory Series A
An inequality for Tutte polynomials
Combinatorica
On the asymptotic proportion of connected matroids
European Journal of Combinatorics
On the structure of the h-vector of a paving matroid
European Journal of Combinatorics
The Merino-Welsh conjecture holds for series-parallel graphs
European Journal of Combinatorics
Hi-index | 0.00 |
We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portion of the line x+y=p lying in the positive quadrant. Every coloopless paving matroid is in the class of matroids which contain two disjoint bases or whose ground set is the union of two bases. For this latter class we give a proof that T"M(a,a)@?max{T"M(2a,0),T"M(0,2a)} for a=2. We conjecture that T"M(1,1)@?max{T"M(2,0),T"M(0,2)} for the same class of matroids. We also prove this conjecture for some families of graphs and matroids.