Journal title
Journal of Combinatorial Theory, Series B
DOI
10.1016/j.jctb.2014.08.002
Volume
110
Last updated
2024-04-23T10:45:45.74+01:00
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
On
Favourite
On
Publication type
Journal Article
Publication date
18 Oct 2014