8 citations · 33 across the 25 of their papers we have counts for
5 papers · 1 filter
Approximating the chromatic polynomial is as hard as computing it exactly
Ferenc Bencs, Jeroen Huijben, Guus Regts
We show that for any non-real algebraic number such that or it is \textsc{\#P}-hard to compute a multiplicative (resp. additive) approximation to…
Random cluster model on regular graphs
Ferenc Bencs, Márton Borbényi, Péter Csikvári
For a graph with vertices the partition function of the random cluster model is defined by where denotes…
On the location of chromatic zeros of series-parallel graphs
Ferenc Bencs, Jeroen Huijben, Guus Regts
In this paper we consider the zeros of the chromatic polynomial of series-parallel graphs. Complementing a result of Sokal, showing density outside the disk , we show d…
On complex roots of the independence polynomial
Ferenc Bencs, Péter Csikvári, Piyush Srivastava +1
It is known from the work of Shearer (1985) (and also Scott and Sokal (2005)) that the independence polynomial of a graph of maximum degree at most does not vani…
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 +1
In this paper we prove that for any integer , the anti-ferromagnetic -state Potts model on the infinite -regular tree has a unique Gibbs measure for all edge interac…