Almost-spanning universality in random graphs (extended abstract)
From MaRDI portal
Publication:322227
DOI10.1016/J.ENDM.2015.06.030zbMATH Open1346.05264OpenAlexW2212944932MaRDI QIDQ322227FDOQ322227
Authors: David Conlon, Asaf Ferber, Rajko Nenadov, Nemanja Škorić 
Publication date: 14 October 2016
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957531
Recommendations
- Almost-spanning universality in random graphs
- Spanning universality in random graphs
- Universality of random graphs
- Universality for bounded degree spanning trees in randomly perturbed graphs
- On universal representation of random graphs
- Some large deviation results for sparse random graphs
- On the spread of random graphs
- Universality for the distance in finite variance random graphs
- On spanning structures in random hypergraphs
Cites Work
- Sparse universal graphs
- An improved upper bound on the density of universal random graphs
- Local resilience of almost spanning trees in random graphs
- Title not available (Why is that?)
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- On Graphs Which Contain All Sparse Graphs
- Hall's theorem for hypergraphs
- On Universal Graphs for Spanning Trees
- Title not available (Why is that?)
- Sparse universal graphs for bounded‐degree graphs
Cited In (12)
- Universal edge scaling in random partitions
- Spanning structures and universality in sparse hypergraphs
- Almost universal graphs
- An improved upper bound on the density of universal random graphs
- Spanning universality in random graphs
- Almost spanning universality in random graphs
- Universality of graphs with few triangles and anti-triangles
- 2-universality in randomly perturbed graphs
- On universal representation of random graphs
- Almost-spanning universality in random graphs
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Sandwiching random graphs: universality between random graph models
This page was built for publication: Almost-spanning universality in random graphs (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322227)
