Intersections of random hypergraphs and tournaments
Given two random hypergraphs, or two random tournaments of order n, how much (or little) can we make them overlap by placing them on the same vertex set? We give asymptotic answers to this question.
European Journal of Combinatorics
Bollobás, B., & Scott, A. (2015). Intersections of random hypergraphs and tournaments. European Journal of Combinatorics, 44 (PA), 125-139. https://doi.org/10.1016/j.ejc.2014.08.023