English

Evaluations of Tutte polynomials of regular graphs

Combinatorics 2021-05-17 v1

Abstract

Let TG(x,y)T_G(x,y) be the Tutte polynomial of a graph GG. In this paper we show that if (Gn)n(G_n)_n is a sequence of dd-regular graphs with girth g(Gn)g(G_n)\to \infty, then for x1x\geq 1 and 0y10\leq y\leq 1 we have limnTGn(x,y)1/v(Gn)=td(x,y),\lim_{n\to \infty}T_{G_n}(x,y)^{1/v(G_n)}=t_d(x,y), where td(x,y)={(d1)((d1)2(d1)2x)d/21  \mboxif xd1,x(1+1x1)d/21  \mboxif x>d1.t_d(x,y)=\left\{\begin{array}{lc} (d-1)\left(\frac{(d-1)^2}{(d-1)^2-x}\right)^{d/2-1}&\ \ \mbox{if}\ x\leq d-1,\\ x\left(1+\frac{1}{x-1}\right)^{d/2-1} &\ \ \mbox{if}\ x> d-1. \end{array}\right. independently of yy if 0y10\leq y\leq 1. If (Gn)n(G_n)_n is a sequence of random dd-regular graphs, then the same statement holds true asymptotically almost surely. This theorem generalizes results of McKay (x=1,y=1x=1,y=1, spanning trees of random dd-regular graphs) and Lyons (x=1,y=1x=1,y=1, spanning trees of large-girth dd-regular graphs). Interesting special cases are TG(2,1)T_G(2,1) counting the number of spanning forests, TG(2,0)T_G(2,0) counting the number of acyclic orientations.

Keywords

Cite

@article{arxiv.2105.06798,
  title  = {Evaluations of Tutte polynomials of regular graphs},
  author = {Ferenc Bencs and Péter Csikvári},
  journal= {arXiv preprint arXiv:2105.06798},
  year   = {2021}
}