Evaluations of Tutte polynomials of regular graphs
From MaRDI portal
Publication:2171029
DOI10.1016/j.jctb.2022.08.003zbMath1497.05126arXiv2105.06798OpenAlexW3160297294MaRDI QIDQ2171029
Publication date: 23 September 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.06798
Related Items
Random cluster model on regular graphs ⋮ Upper bound for the number of spanning forests of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
- Holographic algorithms: from art to science
- Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
- Benjamini-Schramm continuity of root moments of graph polynomials
- Basis collapse in holographic algorithms
- Ising models on locally tree-like graphs
- Spanning trees in regular graphs
- Correlation inequalities on some partially ordered sets
- Short cycles in random regular graphs
- Expressiveness of matchgates.
- On the number of forests and connected spanning subgraphs
- Factor models on locally tree-like graphs
- The replica symmetric solution for Potts models on \(d\)-regular graphs
- The Tutte polynomial
- Theory of monomer-dimer systems
- Towards a theory of negative dependence
- Matchings in Benjamini–Schramm convergent graph sequences
- Loop calculus in statistical physics and information science
- Loop series for discrete statistical models on graphs
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Holographic Algorithms
- On Symmetric Signatures in Holographic Algorithms
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- A logical expansion in mathematics
- Complexity Dichotomies for Counting Problems
- Tree-based reparameterization framework for analysis of sum-product and related algorithms
- Negative association in uniform forests and connected graphs
- Left and right convergence of graphs with bounded degree
- Holographic Algorithms: The Power of Dimensionality Resolved
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Asymptotic Enumeration of Spanning Trees
- A Contribution to the Theory of Chromatic Polynomials
