| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656812 | Journal of Combinatorial Theory, Series B | 2015 | 29 Pages |
Abstract
Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of this paper is to investigate these questions.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Béla Bollobás, Alex Scott,