10.1016_0095-8956(83)90060-6.bib

@article{10.1016/0095-8956(83)90060-6,
  title    = {On the maximum cardinality of a consistent set of arcs in a random tournament},
  journal  = {Journal of Combinatorial Theory, Series B},
  volume   = {35},
  number   = {3},
  pages    = {328-332},
  year     = {1983},
  issn     = {0095-8956},
  doi      = {https://doi.org/10.1016/0095-8956(83)90060-6},
  author   = {W {Fernandez de la Vega}},
  abstract = {For any tournament T on n vertices, let h(T) denote the maximum number of edges in the intersection of T with a transitive tournament on the same vertex set. Sharpening a previous result of Spencer, it is proved that, if Tn denotes the random tournament on n vertices, then, P(h(Tn) ≤ 12(2n) + 1.73n32) → 1 as n → ∞.}
}