Journal article
Intersections of hypergraphs
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 352.4KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.jctb.2014.08.002
Authors
- Publisher:
- Elsevier
- Journal:
- Journal of Combinatorial Theory, Series B More from this journal
- Volume:
- 110
- Pages:
- 180-208
- Publication date:
- 2014-10-18
- DOI:
- EISSN:
-
1096-0902
- ISSN:
-
0095-8956
- Keywords:
- Pubs id:
-
pubs:500684
- UUID:
-
uuid:812d1fc9-bf24-4819-ab09-a969452f28d8
- Local pid:
-
pubs:500684
- Source identifiers:
-
500684
- Deposit date:
-
2016-07-09
Terms of use
- Copyright holder:
- Elsevier Inc
- Copyright date:
- 2014
- Notes:
-
This is an
accepted manuscript of a journal article published by Elsevier in Journal of Combinatorial Theory, Series B on 2014-10-18, available online: http://dx.doi.org/10.1016/j.jctb.2014.08.002
If you are the owner of this record, you can report an update to it here: Report update to this record