Search results
Results: 13
Number of items: 13
-
Bencs, F., & Regts, G. (2026). Approximating the Volume of a Truncated Relaxation of the Independence Polytope. Discrete and Computational Geometry, 76(1), 508-525. https://doi.org/10.1007/s00454-026-00824-y -
Berrekkal, K., Regts, G., & Bencs, F. (2026). Deterministic Approximate Counting of Colorings with fewer than 2Δ Colors via Absence of Zeros. TheoretiCS, 5, Article 1. https://doi.org/10.46298/theoretics.26.1 -
Bencs, F., & Buys, P. (2025). Optimal Zero-Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs. Random Structures and Algorithms, 66(4), Article e70018. https://doi.org/10.1002/rsa.70018 -
Bencs, F., Berrekkal, K., & Regts, G. (2025). Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees. Electronic Journal Of Probability, 30, Article 65. https://doi.org/10.1214/25-EJP1327 -
Bencs, F., Buys, P., & Peters, H. (2025). The Limit of the Zero Locus of the Independence Polynomial for Bounded Degree Graphs. Michigan Mathematical Journal, 75(2), 423-448. https://doi.org/10.1307/mmj/20226256 -
Bencs, F., Huijben, J., & Regts, G. (2024). Approximating the chromatic polynomial is as hard as computing it exactly. Computational Complexity, 33(1), Article 1. https://doi.org/10.1007/s00037-023-00247-8 -
Bencs, F., & Csikvári, P. (2023). Upper bound for the number of spanning forests of regular graphs. European Journal of Combinatorics, 110, Article 103677. https://doi.org/10.1016/j.ejc.2022.103677 -
Bencs, F., Borbényi, M., & Csikvári, P. (2023). Random Cluster Model on Regular Graphs. Communications in Mathematical Physics, 399(1), 203-248. https://doi.org/10.1007/S00220-022-04552-1 -
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, Article 140. https://doi.org/10.1007/s10955-023-03145-z -
Regts, G., Huijben, J., & Bencs, F. (2023). On the location of chromatic zeros of series-parallel graphs. The Electronic Journal of Combinatorics, 30(3), Article P3.2. https://doi.org/10.37236/11204
Page 1 of 2