3 citations · 4 across the 4 of their papers we have counts for
4 papers
Number of Eulerian orientations for Benjamini--Schramm convergent graph sequences
Ferenc Bencs, Márton Borbényi, Péter Csikvári
For a graph let denote the number of Eulerian orientations, and denote the number of vertices of . We show that if is a sequence of Euleria…
Random interlacement is a factor of i.i.d
Márton Borbényi, Balázs Ráth, Sándor Rokob
The random interlacement point process (introduced by Sznitman, generalized by Teixeira) is a Poisson point process on the space of labeled doubly infinite nearest neighbour trajec…
Connectedness of the Free Uniform Spanning Forest as a function of edge weights
Marcell Alexy, Márton Borbényi, András Imolay +1
Let be the Cartesian product of a regular tree and a finite connected transitive graph . It is shown in arXiv:2006.06387 that the Free Uniform Spanning Forest ($\mathsf{…
Matchings in regular graphs: minimizing the partition function
Márton Borbényi, Péter Csikvári
For a graph on vertices let denote the number of matchings of size , and consider the partition function . In this paper we s…