2 citations · 2 across the 13 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
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…
math.CO2025
The ineffectiveness of the regularity lemma for bounded degree graphs
Clark Lyons, Grigory Terlov, Zoltán Vidnyánszky
We show that for any , there is no bound computable from on the size of a graph required to approximate a graph of maximum degree at most up to $\va…