Universality of Random Graphs for Graphs of Maximum Degree Two

DOI10.1137/130942437zbMath1305.05209arXiv1310.5873OpenAlexW2073982255WikidataQ105584147 ScholiaQ105584147MaRDI QIDQ2935281

Sang June Lee, Jeong Han Kim

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

zbMATH Keywords

random graphsbounded degree graphsuniversalityuniversal graphsgraph embeddingcontainment problem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Spanning structures and universality in sparse hypergraphs ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ Almost‐spanning universality in random graphs ⋮ On universal hypergraphs ⋮ Universality of random graphs and rainbow embedding ⋮ Optimal threshold for a random graph to be 2-universal

This page was built for publication: Universality of Random Graphs for Graphs of Maximum Degree Two