Universality of Random Graphs for Graphs of Maximum Degree Two
From MaRDI portal
Publication:2935281
DOI10.1137/130942437zbMath1305.05209arXiv1310.5873WikidataQ105584147 ScholiaQ105584147MaRDI QIDQ2935281
Publication date: 22 December 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.5873
random graphs; bounded degree graphs; universality; universal graphs; graph embedding; containment problem
05C80: Random graphs (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Optimal threshold for a random graph to be 2-universal, Almost‐spanning universality in random graphs, On universal hypergraphs, Sparse multipartite graphs as partition universal for graphs with bounded degree, Universality of random graphs and rainbow embedding, Spanning structures and universality in sparse hypergraphs