An extension of the blow-up lemma to arrangeable graphs (2015)
Boettcher, Julia; Kohayakawa, Yoshiharu 
; Taraz, Anusch; Wuerfl, Andreas
Fonte: SIAM Journal on Discrete Mathematics. Unidade: IME
Assuntos: TEORIA DOS GRAFOS, COMBINATÓRIA, GRAFOS ALEATÓRIOS, MÉTODOS PROBABILÍSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOETTCHER, Julia et al. An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, v. 29, n. 2, p. 962-1001, 2015Tradução . . Disponível em: https://doi.org/10.1137/13093827X. Acesso em: 09 nov. 2025.APA
Boettcher, J., Kohayakawa, Y., Taraz, A., & Wuerfl, A. (2015). An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, 29( 2), 962-1001. doi:10.1137/13093827XNLM
Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1137/13093827XVancouver
Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1137/13093827X
