| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653371 | European Journal of Combinatorics | 2015 | 15 Pages |
Abstract
Given two random hypergraphs, or two random tournaments of order nn, how much (or little) can we make them overlap by placing them on the same vertex set? We give asymptotic answers to this question.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Béla Bollobás, Alex Scott,