Show simple item record

dc.contributor.authorFerber, Asaf
dc.contributor.authorSamotij, Wojciech
dc.date.accessioned2022-02-25T17:43:00Z
dc.date.available2022-02-25T17:43:00Z
dc.date.issued2018-09-25
dc.identifier.issn0024-6107
dc.identifier.issn1469-7750
dc.identifier.urihttps://hdl.handle.net/1721.1/140772
dc.languageen
dc.publisherWileyen_US
dc.relation.isversionofhttp://dx.doi.org/10.1112/jlms.12179en_US
dc.rightsArticle 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.sourceWileyen_US
dc.titlePacking trees of unbounded degrees in random graphsen_US
dc.typeArticleen_US
dc.identifier.citationFerber, Asaf and Samotij, Wojciech. 2018. "Packing trees of unbounded degrees in random graphs." Journal of the London Mathematical Society, 99 (3).
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.relation.journalJournal of the London Mathematical Societyen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.date.submission2022-02-10T17:45:28Z
mit.journal.volume99en_US
mit.journal.issue3en_US
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record