P'eter Csikv'ari

activity

20142022

most citedExtremal regular graphs: the case of the infinite regular tree

10 citations · 16 across the 10 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

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.CO2021

Upper bound for the number of spanning forests of regular graphs

Ferenc Bencs, Péter Csikvári

We show that if $G$ is a $d$ --regular graph on $n$ vertices, then the number of spanning forests $F (G)$ satisfies $F (G) \leq d^{n}$ . The previous best bound due to Kahale and Schulman…