Decomposition of directed graphs and the Turán problem

DOI10.1007/s11253-014-0995-7zbMath1308.05091arXiv1312.1544OpenAlexW2094163813MaRDI QIDQ2260873

G. N. Zholtkevich, Lyudmyla Yu. Polyakova, Boris V. Novikov

Publication date: 12 March 2015

Published in: Ukrainian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1544

zbMATH Keywords

forbidden subgraphsvertex decompositions of digraphs

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Formal languages and automata (68Q45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• On graphs without a \(C_{4}\) or a diamond
• Partial actions and automata

This page was built for publication: Decomposition of directed graphs and the Turán problem