dc.contributor.author | Ferber, Asaf | |
dc.contributor.author | Samotij, Wojciech | |
dc.date.accessioned | 2022-02-25T17:43:00Z | |
dc.date.available | 2022-02-25T17:43:00Z | |
dc.date.issued | 2018-09-25 | |
dc.identifier.issn | 0024-6107 | |
dc.identifier.issn | 1469-7750 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/140772 | |
dc.language | en | |
dc.publisher | Wiley | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1112/jlms.12179 | en_US |
dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
dc.source | Wiley | en_US |
dc.title | Packing trees of unbounded degrees in random graphs | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Ferber, Asaf and Samotij, Wojciech. 2018. "Packing trees of unbounded degrees in random graphs." Journal of the London Mathematical Society, 99 (3). | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
dc.relation.journal | Journal of the London Mathematical Society | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.date.submission | 2022-02-10T17:45:28Z | |
mit.journal.volume | 99 | en_US |
mit.journal.issue | 3 | en_US |
mit.license | PUBLISHER_POLICY | |
mit.metadata.status | Authority Work and Publication Information Needed | en_US |