Decomposition of Directed Graphs and the Turán Problem

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.

Saved in:
Bibliographic Details
Published inUkrainian mathematical journal Vol. 66; no. 7; pp. 1070 - 1084
Main Authors Novikov, B. V., Polyakova, L. Yu, Zholtkevich, G. N.
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.12.2014
Springer
Subjects
Algebra
Analysis
Applications of Mathematics
Geometry
Mathematics
Mathematics and Statistics
Statistics
Maximal Match
Free Graph
Connected Graph
Direct Graph
Connected Subset
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0041-5995
1573-9376
DOI:10.1007/s11253-014-0995-7