Abstract
Let G be a graph without loops or bridges and a, b be positive real numbers with b ≥ a(a+2). We show that the Tutte polynomial of G satisfies the inequality T G (b, 0)T G (0, b) ≥ T G (a, a)2. Our result was inspired by a conjecture of Merino and Welsh that T G (1, 1) ≤ max{T G (2, 0),T G (0, 2)}.
Similar content being viewed by others
References
T. Brylawski and J. Oxley: The Tutte polynomial and its applications, in: Matroid Applications (N. White, editor), Encyclopedia of Mathematics and its Applications, Cambridge Univ. Press (1992), 123–225.
C. Greene and T. Zaslavsky: On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions and orientations of graphs; Trans. Amer. Math. Soc.280 (1983), 97–126.
M. Ibañez, C. Merino and M. G. Rodríguez: A note on some inequalities for the Tutte polynomial of a matroid, Electronic Notes in Discrete Mathematics34(1) (2009), 603–607.
M. Las Vergnas: Acyclic and totally cyclic orientations of combinatorial geometries, Discrete Math.20 (1977), 51–61.
C. Merino and D. J. A. Welsh: Forest colourings and acyclic orientations of the square lattice, Annals of Combinatorics3 (1999), 417–429.
R. P. Stanley: Acyclic orientations of graphs, Discrete Math.5 (1973), 171–178.
W. T. Tutte: A contribution to the theory of chromatic polynomials, Canad. J. Math.6 (1953), 80–91.
W. T. Tutte: Graph Theory, Cambridge University Press, Cambridge, 1984.