Every large oriented graph has at least 1/9 - o(1) probability that a random triple is a transitive triangle or an independent set, and the bound is tight.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the local structure of oriented graphs -- a case study in flag algebras
Every large oriented graph has at least 1/9 - o(1) probability that a random triple is a transitive triangle or an independent set, and the bound is tight.