Intersections of hypergraphs
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.
| Главные авторы: | , |
|---|---|
| Формат: | Journal article |
| Опубликовано: |
Elsevier
2014
|