A decomposition of directed graphs and the Turan problem
Combinatorics
2013-12-06 v1
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.
Keywords
Cite
@article{arxiv.1312.1544,
title = {A decomposition of directed graphs and the Turan problem},
author = {B. V. Novikov and L. Yu. Polyakova and G. N. Zholtkevich},
journal= {arXiv preprint arXiv:1312.1544},
year = {2013}
}
Comments
17 pages