An analogue of the Szemeredi Regularity Lemma for bounded degree graphs

Simple item page
dc.creatorElek, Gábor
dc.creatorLippner, Gábor
dc.date2008-09-17
dc.date2009-04-18
dc.date.accessioned2026-07-07T13:05:18Z
dc.date.available2026-07-07T13:05:18Z
dc.descriptionWe 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.
dc.descriptionCorrected an error in the proof of the Homogeneity Lemma. A new result is proved about edge-colorings of convergent graph sequences
dc.identifierhttps://arxiv.org/abs/0809.2879
dc.identifierhttp://arxiv.org/abs/0809.2879
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227447
dc.subjectCombinatorics
dc.subjectDynamical Systems
dc.subject05C99; 37A20
dc.titleAn analogue of the Szemeredi Regularity Lemma for bounded degree graphs
dc.typetext

Files

Collections

arXiv