Ferenc Bencs

most citedOptimal zero-free regions for the independence polynomial of bounded degree hypergraphs

1 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2024

Number of Eulerian orientations for Benjamini--Schramm convergent graph sequences

Ferenc Bencs, Márton Borbényi, Péter Csikvári

For a graph $G$ let $ε (G)$ denote the number of Eulerian orientations, and $v (G)$ denote the number of vertices of $G$ . We show that if $(G_{n})_{n}$ is a sequence of Euleria…

math.CO2024★ 1 cited

Approximating the volume of a truncated relaxation of the independence polytope

Ferenc Bencs, Guus Regts

Answering a question of Gamarnik and Smedira, we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set poly…

math.CO2023★ 1 cited

Optimal zero-free regions for the independence polynomial of bounded degree hypergraphs

Ferenc Bencs, Pjotr Buys

In this paper we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree $Δ$ . For graphs the largest zero-free disk around zero was de…