Abstract
The Tutte polynomial of a graph G is a two-variable polynomial T(G; x, y) that encodes many interesting properties of the graph. We study the complexity of the following problem, for rationals x and y: given as input a planar graph G, determine T(G; x, y). Vertigan completely mapped the complexity of exactly computing the Tutte polynomial of a planar graph. He showed that the problem can be solved in polynomial time if (x, y) is on the hyperbola H q given by (x − 1)(y − 1) = q for q = 1 or q = 2 or if (x, y) is one of the two special points (x, y) = (−1, −1) or (x, y) = (1, 1). Otherwise, the problem is #P-hard. In this paper, we consider the problem of approximating T(G; x, y), in the usual sense of “fully polynomial randomized approximation scheme” or FPRAS. Roughly speaking, an FPRAS is required to produce, in polynomial time and with high probability, an answer that has small relative error. Assuming that NP is different from RP, we show that there is no FPRAS for the Tutte polynomial in a large portion of the (x, y) plane. In particular, there is no FPRAS if x > 1, y < −1 or if y > 1, x < −1 or if x < 0, y < 0 and q > 5. Also, there is no FPRAS if x < 1, y < 1 and q = 3. For q > 5, our result is intriguing because it shows that there is no FPRAS at (x, y) = (1 − q/(1 + ε), −ε) for any positive ε but it leaves open the limit point ε = 0, which corresponds to approximately counting q-colorings of a planar graph.
Similar content being viewed by others
References
Birkhoff G.D., Lewis D.C. (1946) Chromatic polynomials. Trans. Amer. Math. Soc. 60: 355–451 ISSN 0002-9947
Garey M.R., Johnson D.S. (1977) The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4): 826–834 ISSN 0036-1399
Garey M.R., David S. Johnson., Larry J., Larry J. (1976) Some Simplified NP-Complete Graph Problems. Theor. Comput. Sci. 1(3): 237–267
Leslie Ann Goldberg., Mark Jerrum (2008) Inapproximability of the Tutte polynomial. Inform. and Comput. 206(7): 908–929 ISSN 0890-5401
Bill Jackson & Alan D. Sokal (2009). Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids. J. Combin. Theory Ser. B 99(6), 869–903. ISSN 0095-8956. doi:10.1016/j.jctb.2009.03.002.
Jaeger F., Vertigan D.L., Welsh D.J.A. (1990) On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108(1): 35–53 ISSN 0305-0041
Mark Jerrum (2003). Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics ETH Zürich. Birkhäuser Verlag, Basel. ISBN 3-7643-6946-9, xii+112.
Greg Kuperberg (2009). How hard is it to approximate the Jones polynomial? http://arxiv.org/abs/0908.0512.
Christos H. Papadimitriou (1994). Computational complexity. Addison-Wesley Publishing Company, Reading, MA. ISBN 0-201-53082-1, xvi+523.
Alan D. Sokal (2005). The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In Surveys in combinatorics 2005, volume 327 of London Math. Soc. Lecture Note Ser., 173–226. Cambridge Univ. Press, Cambridge. doi:10.1017/CBO9780511734885.009.
W. T. Tutte (1984). Graph theory, volume 21 of Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Company Advanced Book Program, Reading, MA. ISBN 0-201-13520-5, xxi+333. With a foreword by C. St. J. A. Nash-Williams.
Dirk Vertigan (2005). The computational complexity of Tutte invariants for planar graphs. SIAM J. Comput. 35(3), 690–712 (electronic). ISSN 0097-5397.
Welsh D.J.A. (1993) Complexity: knots, colourings and counting, volume 186 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge ISBN 0-521-45740-8, viii+163
Woodall D.R. (1997) The largest real zero of the chromatic polynomial. Discrete Math. 172(1-3): 141–153 ISSN 0012-365X
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Goldberg, L.A., Jerrum, M. Inapproximability of the Tutte polynomial of a planar graph. comput. complex. 21, 605–642 (2012). https://doi.org/10.1007/s00037-012-0046-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-012-0046-4