Decomposition of Directed Graphs and the Turán Problem

Abstract

We consider vertex decompositions of (di)graphs appearing in the automata theory and establish some properties of these decompositions. These decompositions are applied to the problem of forbidden subgraphs.