  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.
