Journal article
Intersections of random hypergraphs and tournaments
- Abstract:
- Given two random hypergraphs, or two random tournaments of order n, how much (or little) can we make them overlap by placing them on the same vertex set? We give asymptotic answers to this question.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 290.3KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.ejc.2014.08.023
Authors
- Publisher:
- Elsevier
- Journal:
- European Journal of Combinatorics More from this journal
- Volume:
- 44
- Issue:
- A
- Pages:
- 125-139
- Publication date:
- 2014-10-20
- Acceptance date:
- 2014-08-08
- DOI:
- ISSN:
-
0195-6698
- Keywords:
- Pubs id:
-
pubs:489091
- UUID:
-
uuid:9bf8cb54-f590-4680-bca1-4f0025a708f1
- Local pid:
-
pubs:489091
- Source identifiers:
-
489091
- Deposit date:
-
2016-07-09
Terms of use
- Copyright holder:
- Elsevier Ltd
- Copyright date:
- 2014
- Notes:
-
This is an
accepted manuscript of a journal article published by Elsevier in European Journal of Combinatorics on 2014-10-20, available online: http://dx.doi.org/10.1016/j.ejc.2014.08.023
If you are the owner of this record, you can report an update to it here: Report update to this record