An improved upper bound on the density of universal random graphs (2015)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu 
; Rodl, Vojtech; Rucinski, Andrzej
Source: Random Structures & Algorithms. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. Random Structures & Algorithms, v. 46, n. 2, p. 274-299, 2015Tradução . . Disponível em: https://doi.org/10.1002/rsa.20545. Acesso em: 27 nov. 2025.APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2015). An improved upper bound on the density of universal random graphs. Random Structures & Algorithms, 46( 2), 274-299. doi:10.1002/rsa.20545NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 2): 274-299.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20545Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 2): 274-299.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1002/rsa.20545
