Measurable versions of Whitney's 2-isomorphism theorem are established for locally finite graphings by defining weak isomorphisms that preserve edge measures, cycles, and hyperfinite subgraphs, with rigidity for weakly 3-connected infinitely-ended cases and implementation via countable measurable Wh
Journal of Combinatorial Theory, Series B , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Whitney's 2-isomorphism theorem for graphings
Measurable versions of Whitney's 2-isomorphism theorem are established for locally finite graphings by defining weak isomorphisms that preserve edge measures, cycles, and hyperfinite subgraphs, with rigidity for weakly 3-connected infinitely-ended cases and implementation via countable measurable Wh