Grigory Terlov

collaborators

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. In the setting of locally finite graphings, we introduce a notion of weak isomo…

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 $I^ \geq 3$ , there is no bound computable from $(ε, r)$ on the size of a graph required to approximate a graph of maximum degree at most $I^$ up to $\…