A decomposition of directed graphs and the Turan problem
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.