Intersections of hypergraphs

Author: 

Scott, A
Bollobas, B

Publication Date: 

18 October 2014

Journal: 

Journal of Combinatorial Theory, Series B

Last Updated: 

2020-03-01T22:17:29.443+00:00

Volume: 

110

DOI: 

10.1016/j.jctb.2014.08.002

page: 

180-208

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.

Symplectic id: 

500684

Submitted to ORA: 

Submitted

Publication Type: 

Journal Article