Abstract
Transitive tournament (including transitive triangle) and its blow-up have some symmetric properties. In this work, we establish an analogue result of the Erdös-Stone theorem of weighted digraphs with a forbidden blow-up of the transitive tournament. We give a stability result of oriented graphs and digraphs with forbidden blow-up transitive triangles and show that almost all oriented graphs and digraphs with forbidden blow-up transitive triangles are almost bipartite, which reconfirms and strengthens the conjecture of Cherlin.
Funder
Natural Science Foundation of Guangdong Province
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference20 articles.
1. Supersaturated graphs and hypergraphs;Sinomovits;Combinatorica,1983
2. Asymptotic enumeration of Kn-free graphs;Kleitman;Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973),1976
3. Kℓ+1-free graphs: Asymptotic structure and a 0–1 law;Kolaitis;Trans. Amer. Math. Soc.,1987
4. The number of graphs without forbidden subgraphs;Balogh;J. Combin. Theory Ser. B,2004
5. The typical structure of graphs without given excluded subgraphs;Balogh;Random Struct. Algorithms,2009