Typical structure of oriented graphs and digraphs with forbidden blow-up transitive triangle

2017/03/09 by Liu, Jianxi
#05C20 #05C35 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1703.03080

Abstract

In this work, we establish an analogue result of the Erdös-Stone theorem of weighted digraphs using Regularity Lemma of digraphs. We give a stability result of oriented graphs and digraphs with forbidden blow-up transitive triangle and show that almost all oriented graphs and almost all digraphs with forbidden blow-up transitive triangle are almost bipartite respectively.

Related

• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• Oriented trees and paths in digraphs
• Path decompositions of oriented graphs
• Oriented trees in digraphs with large girth
• χ-bounded families of oriented graphs