An Improved Upper Bound on the Density of Universal Random Graphs

DOI10.1007/978-3-642-29344-3_20zbMath1266.05151OpenAlexW1649797278WikidataQ105584536 ScholiaQ105584536MaRDI QIDQ2894468

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

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_20

zbMATH Keywords

densitypseudorandombounded maximum degreepolynomail time randomized algorithm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Almost-spanning universality in random graphs (extended abstract) ⋮ Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Powers of Hamilton cycles in pseudorandom graphs ⋮ An improved upper bound on the density of universal random graphs

This page was built for publication: An Improved Upper Bound on the Density of Universal Random Graphs