8 citations · 33 across the 25 of their papers we have counts for
6 papers · 1 filter
The limit of the zero locus of the independence polynomial for bounded degree graphs
Ferenc Bencs, Pjotr Buys, Han Peters
The goal of this paper is to accurately describe the maximal zero-free region of the independence polynomial for graphs of bounded degree, for large degree bounds. In previous work…
Factor-of-iid balanced orientation of non-amenable graphs
Ferenc Bencs, Aranka Hrušková, László Márton Tóth
We show that if a non-amenable, quasi-transitive, unimodular graph has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal in- and…
Evaluations of Tutte polynomials of regular graphs
Ferenc Bencs, Péter Csikvári
Let be the Tutte polynomial of a graph . In this paper we show that if is a sequence of -regular graphs with girth , then for …
Upper bound for the number of spanning forests of regular graphs
Ferenc Bencs, Péter Csikvári
We show that if is a --regular graph on vertices, then the number of spanning forests satisfies . The previous best bound due to Kahale and Schulman…
Extremizers and stability of the Betke--Weil inequality
Ferenc A. Bartha, Ferenc Bencs, Károly J. Böröczky +1
Let be a compact convex domain in the Euclidean plane. The mixed area of and can be bounded from above by , where is the perimete…
Factor-of-iid Schreier decorations of lattices in Euclidean spaces
Ferenc Bencs, Aranka Hrušková, László Márton Tóth
A Schreier decoration is a combinatorial coding of an action of the free group on the vertex set of a -regular graph. We investigate whether a Schreier decoration exists…