Cherlin's conjecture on almost all triangle-free oriented graphs
A -free oriented graph is an oriented graph containing no transitive tournament on three vertices. Cherlin's conjecture. Almost all -free oriented graphs are tripartite. This conjecture concerns the typical structure of oriented graphs avoiding a transitive triangle; its resolution is not indicated in the source.
References
Primary source
Jianxi Liu, “Typical structure of oriented graphs and digraphs with forbidden blow-up transitive triangle”, arXiv:1703.03080 (2017).
Additional references
2 papers in this index state this conjecture (2014–2017). The statement above is taken from the most recent of them; the others are arXiv:1404.6178.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.