A decomposition of directed graphs and the Turan problem
arXiv:1312.1544
Abstract
We consider vertex decompositions of (di)graphs which appear in Automata Theory, and establish some their properties. Then we apply them to the problem of forbidden subgraphs.
17 pages