Journal article

Packing random graphs and hypergraphs

Abstract:: We determine to within a constant factor the threshold for the property that two random k-uniform hypergraphs with edge probability p have an edge-disjoint packing into the same vertex set. More generally, we allow the hypergraphs to have different densities. In the graph case, we prove a stronger result, on packing a random graph with a fixed graph.

Publication status:: Published

Peer review status:: Peer reviewed

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Bollobas, B., Janson, S., & Scott, A. (2016). Packing random graphs and hypergraphs. Random Structures and Algorithms, 51(1), 3–13.

MLA Style

Bollobas, B., et al. “Packing Random Graphs and Hypergraphs.” Random Structures and Algorithms, vol. 51, no. 1, Wiley, 2016, pp. 3–13.

Chicago Style

Bollobas, B, S Janson, and A Scott. 2016. “Packing Random Graphs and Hypergraphs.” Random Structures and Algorithms 51 (1): 3–13.
Share
Print

Access Document

Files:: randompack.pdf

(Preview, Accepted manuscript, pdf, 292.9KB, Terms of use)

Publisher copy:: 10.1002/rsa.20673

Authors

+ Bollobas, B More by this author

Role:: Author

+ Janson, S More by this author

Role:: Author

+ Scott, A More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Mathematical Institute
Role:: Author

Publisher:: Wiley
Journal:: Random Structures and Algorithms More from this journal
Volume:: 51
Issue:: 1
Pages:: 3–13
Publication date:: 2016-11-01
Acceptance date:: 2016-03-09
DOI:: 10.1002/rsa.20673
ISSN:: 1098-2418

Keywords:: SBTMR
Pubs id:: pubs:632959
UUID:: uuid:8f87ba81-cb1a-43bb-bff6-d00132932ae0
Local pid:: pubs:632959
Source identifiers:: 632959
Deposit date:: 2016-07-09

Terms of use

Copyright holder:: Carlos Pereira et al
Copyright date:: 2016
Notes:: This is the peer reviewed version of the following article: "Packing random graphs and hypergraphs", which has been published in final form at 10.1002/rsa.20673. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP