Publication Date:
January 2015
Journal:
JOURNAL OF COMBINATORIAL THEORY SERIES B
Last Updated:
2020-01-20T10:04:33.037+00:00
Volume:
110
DOI:
10.1016/j.jctb.2014.08.002
page:
180-208
abstract:
© 2014 Elsevier Inc. 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
Download URL:
Submitted to ORA:
Not Submitted
Publication Type:
Journal Article