ReP USP - Resultado da busca

Filtros : "Reino Unido" "IME" "Bottcher, Julia" Limpar

Filtros

Artigo de periodico
Triangle-free subgraphs of random graphs (2018)
Allen, Peter; Bottcher, Julia; Kohayakawa, Yoshiharu ; Roberts, Barnaby
Fonte: Combinatorics, Probability & Computing. Unidade: IME
Assuntos: COMBINATÓRIA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Triangle-free subgraphs of random graphs. Combinatorics, Probability & Computing, v. 27, n. 2, p. 141-161, 2018Tradução . . Disponível em: https://doi.org/10.1017/S0963548317000219. Acesso em: 24 jul. 2024.
APA
Allen, P., Bottcher, J., Kohayakawa, Y., & Roberts, B. (2018). Triangle-free subgraphs of random graphs. Combinatorics, Probability & Computing, 27( 2), 141-161. doi:10.1017/S0963548317000219
NLM
Allen P, Bottcher J, Kohayakawa Y, Roberts B. Triangle-free subgraphs of random graphs [Internet]. Combinatorics, Probability & Computing. 2018 ; 27( 2): 141-161.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1017/S0963548317000219
Vancouver
Allen P, Bottcher J, Kohayakawa Y, Roberts B. Triangle-free subgraphs of random graphs [Internet]. Combinatorics, Probability & Computing. 2018 ; 27( 2): 141-161.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1017/S0963548317000219
Artigo de periodico
Almost spanning subgraphs of random graphs after adversarial edge removal (2013)
Bottcher, Julia; Kohayakawa, Yoshiharu ; Taraz, Anusch
Fonte: Combinatorics, Probability & Computing. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTTCHER, Julia e KOHAYAKAWA, Yoshiharu e TARAZ, Anusch. Almost spanning subgraphs of random graphs after adversarial edge removal. Combinatorics, Probability & Computing, v. 22, n. 5, p. 639-683, 2013Tradução . . Disponível em: https://doi.org/10.1017/S0963548313000199. Acesso em: 24 jul. 2024.
APA
Bottcher, J., Kohayakawa, Y., & Taraz, A. (2013). Almost spanning subgraphs of random graphs after adversarial edge removal. Combinatorics, Probability & Computing, 22( 5), 639-683. doi:10.1017/S0963548313000199
NLM
Bottcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Combinatorics, Probability & Computing. 2013 ; 22( 5): 639-683.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1017/S0963548313000199
Vancouver
Bottcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Combinatorics, Probability & Computing. 2013 ; 22( 5): 639-683.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1017/S0963548313000199

Biblioteca Digital de Produção Intelectual da Universidade de São Paulo 2012 - 2024