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 2020Show all

2 papers · 1 filter

math.CO2020

Matchings in regular graphs: minimizing the partition function

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

For a graph $G$ on $v (G)$ vertices let $m_{k} (G)$ denote the number of matchings of size $k$ , and consider the partition function $M_{G} (λ) = \sum_{k = 0}^{n} m_{k} (G) λ^{k}$ . In this paper we s…

math.CO2020★ 2 cited

On the number of forests and connected spanning subgraphs

Márton Borbényi, Péter Csikvári, Haoran Luo

Let $F (G)$ be the number of forests of a graph $G$ . Similarly let $C (G)$ be the number of connected spanning subgraphs of a connected graph $G$ . We bound $F (G)$ and $C (G)$ for regu…