Ferenc Bencs

27 papers A* 1Journal 26
YearRankTypeTitle / Venue / Authors
2026 J jnl
Deterministic approximate counting of colorings with fewer than 2Δ colors via absence of zeros.
TheoretiCS
Ferenc Bencs, Khallil Berrekkal, Guus Regts
2025 J jnl
Barvinok's interpolation method meets Weitz's correlation decay approach.
CoRR
Ferenc Bencs, Guus Regts
2025 J jnl
Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs.
CoRR
Ferenc Bencs, Guus Regts
2025 J jnl
On the complex zeros and the computational complexity of approximating the reliability polynomial.
CoRR
Ferenc Bencs, Chiara Piombi, Guus Regts
2025 J jnl
On zeros and algorithms for disordered systems: mean-field spin glasses.
CoRR
Ferenc Bencs, Kuikui Liu, Guus Regts
2025 J jnl
Optimal Zero-Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs.
Random Struct. Algorithms
Ferenc Bencs, Pjotr Buys
2024 J jnl
Approximating the chromatic polynomial is as hard as computing it exactly.
Comput. Complex.
Ferenc Bencs, Jeroen Huijben, Guus Regts
2024 J jnl
Approximating the volume of a truncated relaxation of the independence polytope.
CoRR
Ferenc Bencs, Guus Regts
2024 J jnl
Deterministic approximate counting of colorings with fewer than 2Δ colors via absence of zeros.
CoRR
Ferenc Bencs, Khallil Berrekkal, Guus Regts
2024 J jnl
Factor-of-iid Schreier decorations of lattices in Euclidean spaces.
Discret. Math.
Ferenc Bencs, Aranka Hrusková, László Márton Tóth
2024 J jnl
Factor-of-iid balanced orientation of non-amenable graphs.
Eur. J. Comb.
Ferenc Bencs, Aranka Hrusková, László Márton Tóth
2023 J jnl
Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees.
CoRR
Ferenc Bencs, Khallil Berrekkal, Guus Regts
2023 A* conf
On complex roots of the independence polynomial.
SODA
Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák
2023 J jnl
On the Location of Chromatic Zeros of Series-Parallel Graphs.
Electron. J. Comb.
Ferenc Bencs, Jeroen Huijben, Guus Regts
2023 J jnl
Upper bound for the number of spanning forests of regular graphs.
Eur. J. Comb.
Ferenc Bencs, Péter Csikvári
2022 J jnl
Approximating the chromatic polynomial is as hard as computing it exactly.
CoRR
Ferenc Bencs, Jeroen Huijben, Guus Regts
2022 J jnl
Evaluations of Tutte polynomials of regular graphs.
J. Comb. Theory B
Ferenc Bencs, Péter Csikvári
2022 J jnl
On complex roots of the independence polynomial.
CoRR
Ferenc Bencs, Péter Csikvári, Piyush Srivastava, Jan Vondrák
2022 J jnl
On the location of chromatic zeros of series-parallel graphs.
CoRR
Ferenc Bencs, Jeroen Huijben, Guus Regts
2022 J jnl
Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite Δ-regular tree for large Δ.
CoRR
Ferenc Bencs, David de Boer, Pjotr Buys, Guus Regts
2021 J jnl
Some Applications of Wagner's Weighted Subgraph Counting Polynomial.
Electron. J. Comb.
Ferenc Bencs, Péter Csikvári, Guus Regts
2021 J jnl
Some coefficient sequences related to the descent polynomial.
Eur. J. Comb.
Ferenc Bencs
2018 J jnl
Christoffel-Darboux Type Identities for the Independence Polynomial.
Comb. Probab. Comput.
Ferenc Bencs
2018 J jnl
On trees with real-rooted independence polynomial.
Discret. Math.
Ferenc Bencs
2018 J jnl
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs.
CoRR
Ferenc Bencs, Ewan Davies, Viresh Patel, Guus Regts
2017 J jnl
One more remark on the adjoint polynomial.
Eur. J. Comb.
Ferenc Bencs
2016 J jnl
Compositions of Complements of Graphs.
Integers
Péter Árendás, Ferenc Bencs, Zoltán Blázsik, Csaba Szabó