# Journal article

## Almost-spanning universality in random graphs

Abstract:
A graph G is said to be inline image-universal if it contains every graph on at most n vertices with maximum degree at most Δ. It is known that for any inline image and any natural number Δ there exists inline image such that the random graph G(n, p) is asymptotically almost surely inline image-universal for inline image. Bypassing this natural boundary, we show that for inline image the same conclusion holds when inline image.
Publication status:
Published
Peer review status:
Peer reviewed

### Access Document

Publisher copy:
10.1002/rsa.20661

### Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Author
More from this funder
Funding agency for:
Conlon, D
Publisher:
Wiley Publisher's website
Journal:
Random Structures and Algorithms Journal website
Publication date:
2016-01-01
Acceptance date:
2016-01-12
DOI:
EISSN:
1098-2418
ISSN:
1042-9832
Keywords:
Pubs id:
pubs:637304
UUID:
uuid:040382a4-e4d9-407e-889d-99c9182cc46e
Local pid:
pubs:637304
Source identifiers:
637304
Deposit date:
2016-10-12