Evaluations of Tutte polynomials of regular graphs
Combinatorics
2021-05-17 v1
Abstract
Let be the Tutte polynomial of a graph . In this paper we show that if is a sequence of -regular graphs with girth , then for and we have where independently of if . If is a sequence of random -regular graphs, then the same statement holds true asymptotically almost surely. This theorem generalizes results of McKay (, spanning trees of random -regular graphs) and Lyons (, spanning trees of large-girth -regular graphs). Interesting special cases are counting the number of spanning forests, 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}
}