M'arton Borb'enyi

activity

20202024

most citedRandom interlacement is a factor of i.i.d

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2024

Number of Eulerian orientations for Benjamini--Schramm convergent graph sequences

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

For a graph $G$ let $ε (G)$ denote the number of Eulerian orientations, and $v (G)$ denote the number of vertices of $G$ . We show that if $(G_{n})_{n}$ is a sequence of Euleria…

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…