3 citations · 5 across the 3 of their papers we have counts for
4 papers
Whitney's 2-isomorphism theorem for graphings
Márton Borbényi, Grigory Terlov, László Márton Tóth
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. For locally finite graphings, we define a weak isomorphism to be an edge-measur…
Random cluster model on regular graphs
Ferenc Bencs, Márton Borbényi, Péter Csikvári
For a graph with vertices the partition function of the random cluster model is defined by where denotes…
On the number of forests and connected spanning subgraphs
Márton Borbényi, Péter Csikvári, Haoran Luo
Let be the number of forests of a graph . Similarly let be the number of connected spanning subgraphs of a connected graph . We bound and for regu…
Counting degree-constrained subgraphs and orientations
Márton Borbényi, Péter Csikvári
The goal of this short paper to advertise the method of gauge transformations (aka holographic reduction, reparametrization) that is well-known in statistical physics and computer…