Ferenc Bencs

activity

20142026

most citedFactor-of-iid Schreier decorations of lattices in Euclidean spaces

8 citations · 33 across the 25 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017★ 1 cited

One more remark on the adjoint polynomial

Ferenc Bencs

The adjoint polynomial of $G$ is \[h(G,x)=\sum_{k=1}^n(-1)^{n-k}a_k(G)x^k,\] where $a_{k} (G)$ denotes the number of ways one can cover all vertices of the graph $G$ by exactly $k$ di…

math.CO2017★ 3 cited

On trees with real rooted independence polynomial

Ferenc Bencs

The independence polynomial of a graph $G$ is \[I(G,x)=\sum\limits_{k\ge 0}i_k(G)x^k,\] where $i_{k} (G)$ denotes the number of independent sets of $G$ of size $k$ (note that $i_0(G)=…