Compositions of Complements of Graphs. - Péter Árendás; Ferenc Bencs; Zoltán Blázsik; Csaba Szabó (Integers, 2016)

One more remark on the adjoint polynomial. - Ferenc Bencs (Eur. J. Comb., 2017)

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. - Ferenc Bencs; Ewan Davies; Viresh Patel; Guus Regts (CoRR, 2018)

Christoffel-Darboux Type Identities for the Independence Polynomial. - Ferenc Bencs (Comb. Probab. Comput., 2018)

On trees with real-rooted independence polynomial. - Ferenc Bencs (Discret. Math., 2018)

Some Applications of Wagner's Weighted Subgraph Counting Polynomial. - Ferenc Bencs; Péter Csikvári; Guus Regts (Electron. J. Comb., 2021)

Some coefficient sequences related to the descent polynomial. - Ferenc Bencs (Eur. J. Comb., 2021)

Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite Δ-regular tree for large Δ. - Ferenc Bencs; David de Boer; Pjotr Buys; Guus Regts (CoRR, 2022)

Evaluations of Tutte polynomials of regular graphs. - Ferenc Bencs; Péter Csikvári (J. Comb. Theory B, 2022)

On complex roots of the independence polynomial. - Ferenc Bencs; Péter Csikvári; Piyush Srivastava 001; Jan Vondrák (SODA, 2023)

On the Location of Chromatic Zeros of Series-Parallel Graphs. - Ferenc Bencs; Jeroen Huijben; Guus Regts (Electron. J. Comb., 2023)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees. - Ferenc Bencs; Khallil Berrekkal; Guus Regts (CoRR, 2023)

Upper bound for the number of spanning forests of regular graphs. - Ferenc Bencs; Péter Csikvári (Eur. J. Comb., 2023)

Approximating the volume of a truncated relaxation of the independence polytope. - Ferenc Bencs; Guus Regts (CoRR, 2024)

Deterministic approximate counting of colorings with fewer than 2Δ colors via absence of zeros. - Ferenc Bencs; Khallil Berrekkal; Guus Regts (CoRR, 2024)

Factor-of-iid Schreier decorations of lattices in Euclidean spaces. - Ferenc Bencs; Aranka Hrusková; László Márton Tóth (Discret. Math., 2024)

Factor-of-iid balanced orientation of non-amenable graphs. - Ferenc Bencs; Aranka Hrusková; László Márton Tóth (Eur. J. Comb., 2024)

Approximating the chromatic polynomial is as hard as computing it exactly. - Ferenc Bencs; Jeroen Huijben; Guus Regts (Comput. Complex., 2024)

Optimal Zero-Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs. - Ferenc Bencs; Pjotr Buys (Random Struct. Algorithms, 2025)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs. - Ferenc Bencs; Guus Regts (CoRR, 2025)

Barvinok's interpolation method meets Weitz's correlation decay approach. - Ferenc Bencs; Guus Regts (CoRR, 2025)

On zeros and algorithms for disordered systems: mean-field spin glasses. - Ferenc Bencs; Kuikui Liu; Guus Regts (CoRR, 2025)