2000 character limit reached
A decomposition of directed graphs and the Turan problem
Published 5 Dec 2013 in math.CO | (1312.1544v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.