An analogue of the Szemeredi Regularity Lemma for bounded degree graphs
Combinatorics
2009-04-18 v2 Dynamical Systems
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.
Keywords
Cite
@article{arxiv.0809.2879,
title = {An analogue of the Szemeredi Regularity Lemma for bounded degree graphs},
author = {Gábor Elek and Gábor Lippner},
journal= {arXiv preprint arXiv:0809.2879},
year = {2009}
}
Comments
Corrected an error in the proof of the Homogeneity Lemma. A new result is proved about edge-colorings of convergent graph sequences