We define folding of a directed graph as a coloring which is injective on all down sets of a given graph. This is then applied to existence bounds for minor closed classes.
