An analogue of the Szemeredi Regularity Lemma for bounded degree graphs
classification
🧮 math.CO
math.DS
keywords
boundeddegreeanalogueclassicaldecomposeddecompositionergodicfarrell-varadarajan
read the original abstract
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.