An improved upper bound on the density of universal random graphs

DOI10.1002/rsa.20545zbMath1309.05160WikidataQ101496253 ScholiaQ101496253MaRDI QIDQ4982616

Vojtěch Rödl, Andrzej Ruciński, Domingos jun. Dellamonica, Yoshiharu Kohayakawa

Publication date: 9 April 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20545

zbMATH Keywords

random graphs; embeddings; universality; spanning subgraphs

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms

05C42: Density (toughness, etc.)