Ferenc Bencs

activity

20172021

most citedOn trees with real rooted independence polynomial

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

collaborators

7 papers

math.CO2021

Evaluations of Tutte polynomials of regular graphs

Ferenc Bencs, Péter Csikvári

Let $T_{G} (x, y)$ be the Tutte polynomial of a graph $G$ . In this paper we show that if $(G_{n})_{n}$ is a sequence of $d$ -regular graphs with girth $g (G_{n}) \to \infty$ , then for $x \geq 1$ …

math.MG2021

Extremizers and stability of the Betke--Weil inequality

Ferenc A. Bartha, Ferenc Bencs, Károly J. Böröczky +1

Let $K$ be a compact convex domain in the Euclidean plane. The mixed area $A (K, - K)$ of $K$ and $- K$ can be bounded from above by $1/ (63) L (K)^{2}$ , where $L (K)$ is the perimete…

math.CO2020

Some applications of Wagner's weighted subgraph counting polynomial

Ferenc Bencs, Péter Csikvári, Guus Regts

We use Wagner's weighted subgraph counting polynomial to prove that the partition function of the anti-ferromagnetic Ising model on line graphs is real rooted and to prove that roo…

math.PR2020★ 1 cited

Atoms of the matching measure

Ferenc Bencs, András Mészáros

We prove that the matching measure of an infinite vertex-transitive connected graph has no atoms. Generalizing the results of Salez, we show that for an ergodic non-amenable unimod…

math.CO2018

Note on the zero-free region of the hard-core model

Ferenc Bencs, Péter Csikvári

In this paper we prove a new zero-free region for the partition function of the hard-core model, that is, the independence polynomials of graphs with largest degree $Δ$ . This new d…

math.CO2018

Some coefficient sequences related to the descent polynomial

Ferenc Bencs

The descent polynomial of a finite $I \subseteq Z^{+}$ is the polynomial $d (I, n)$ , for which the evaluation at $n > max (I)$ is the number of permutations on $n$ elements, such…