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.
English version (Springer): Ukrainian Mathematical Journal 66 (2014), no. 7, pp 1070-1084.
Citation Example: Novikov B. V., Polyakova L. Yu., Zholtkevich G. N. Decomposition of Directed Graphs and the Turán Problem // Ukr. Mat. Zh. - 2014. - 66, № 7. - pp. 958–969.
Full text
