ReP USP - Resultado da busca

Filtros : "COMBINATÓRIA PROBABILÍSTICA" "Alemanha" Limpar

Filtros

Artigo de periodico
Near-perfect clique-factors in sparse pseudorandom graphs (2021)
Han, Jie ; Kohayakawa, Yoshiharu ; Person, Yury
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie e KOHAYAKAWA, Yoshiharu e PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, v. 30, n. 4, p. 570-590, 2021Tradução . . Disponível em: https://doi.org/10.1017/S0963548320000577. Acesso em: 12 nov. 2025.
APA
Han, J., Kohayakawa, Y., & Person, Y. (2021). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, 30( 4), 570-590. doi:10.1017/S0963548320000577
NLM
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2025 nov. 12 ] Available from: https://doi.org/10.1017/S0963548320000577
Vancouver
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2025 nov. 12 ] Available from: https://doi.org/10.1017/S0963548320000577
Artigo de periodico
Monochromatic trees in random graphs (2019)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias
Source: Mathematical Proceedings of the Cambridge Philosophical Society. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MOTA, Guilherme Oliveira e SCHACHT, Mathias. Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, v. 166, n. 1, p. 191-208, 2019Tradução . . Disponível em: https://doi.org/10.1017/S0305004117000846. Acesso em: 12 nov. 2025.
APA
Kohayakawa, Y., Mota, G. O., & Schacht, M. (2019). Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 166( 1), 191-208. doi:10.1017/S0305004117000846
NLM
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.[citado 2025 nov. 12 ] Available from: https://doi.org/10.1017/S0305004117000846
Vancouver
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.[citado 2025 nov. 12 ] Available from: https://doi.org/10.1017/S0305004117000846

Digital Library of Intellectual Production of Universidade de São Paulo 2012 - 2025