Ferenc Bencs

Volledige naam

F Bencs

E-mail

Ferenc.Bencs@cwi.nl

Telefoon

+31 20 592 4152

Kamer

M238

Afdeling(en)

Networks and Optimization

Functie(s)

Researcher

Ferenc Bencs

Bencs, F., Huijben, J., & Regts, G. (2024). Approximating the chromatic polynomial is as hard as computing it exactly. Computational Complexity, 33, 1:1–1:47. doi:10.1007/s00037-023-00247-8
Bencs, F., Hrušková, A., & Tóth, L. M. (2023). Factor-of-iid balanced orientation of non-amenable graphs. European Journal of Combinatorics, 115, 103784:1–103784:20. doi:10.1016/j.ejc.2023.103784
Bencs, F., de Boer, D., Buys, P., & Regts, G. (2023). Uniqueness of the Gibbs measure for the anti-ferromagnetic

Potts model on the Infinite Δ-regular tree for large Δ. Journal of Statistical Physics, 190, 140:1–140:24. doi:10.1007/s10955-023-03145-z
Bencs, F., & Csikvári, P. (2023). Upper bound for the number of spanning forests of regular graphs. European Journal of Combinatorics, 110, 103677:1–103677:12. doi:10.1016/j.ejc.2022.103677
Bencs, F., Csikvári, P., Srivastava, P., & Vondrák, J. (2023). On complex roots of the independence polynomial. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 675–699). doi:10.1137/1.9781611977554.ch29
Bencs, F., Borbényi, M., & Csikvári, P. (2022). Random cluster model on regular graphs. Communications in Mathematical Physics, 399, 203–248. doi:10.1007/s00220-022-04552-1

Partition functions of large-degree networks (None)