Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$
From MaRDI portal
Publication:3061179
DOI10.1002/rsa.20337zbMath1216.05141OpenAlexW2914250110WikidataQ105584997 ScholiaQ105584997MaRDI QIDQ3061179
Publication date: 14 December 2010
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20337
Related Items
Expanders Are Universal for the Class of All Spanning Trees, Universality of random graphs and rainbow embedding, An improved upper bound on the density of universal random graphs, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Expanding graphs contain all small trees
- On graphs which contain all small trees
- Sparse universal graphs
- Perfect Storage Representations for Families of Data Structures
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- On Graphs Which Contain All Sparse Graphs
- Spanning Subgraphs of Random Graphs
- On Universal Graphs for Spanning Trees
- Sparse universal graphs for bounded‐degree graphs
