ReP USP - Resultado da busca

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: 10 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. 10 ] 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. 10 ] Available from: https://doi.org/10.1017/S0963548320000577
Trabalho de evento
Extremal and probabilistic results for order types (2019)
Han, Jie; Kohayakawa, Yoshiharu ; Sales, Marcelo T; Stagni, Henrique
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. Extremal and probabilistic results for order types. 2019, Anais.. Philadelphia: SIAM, 2019. Disponível em: https://doi.org/10.1137/1.9781611975482.27. Acesso em: 10 nov. 2025.
APA
Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). Extremal and probabilistic results for order types. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611975482.27
NLM
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2025 nov. 10 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Vancouver
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2025 nov. 10 ] Available from: https://doi.org/10.1137/1.9781611975482.27
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: 10 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. 10 ] 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. 10 ] Available from: https://doi.org/10.1017/S0305004117000846
Artigo de periodico
Chromatic thresholds in dense random graphs (2017)
Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu ; Morris, Robert
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Chromatic thresholds in dense random graphs. Random Structures & Algorithms, v. 51, n. 2, p. 185-214, 2017Tradução . . Disponível em: https://doi.org/10.1002/rsa.20708. Acesso em: 10 nov. 2025.
APA
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y., & Morris, R. (2017). Chromatic thresholds in dense random graphs. Random Structures & Algorithms, 51( 2), 185-214. doi:10.1002/rsa.20708
NLM
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in dense random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 185-214.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1002/rsa.20708
Vancouver
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in dense random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 185-214.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1002/rsa.20708
Artigo de periodico
Chromatic thresholds in sparse random graphs (2017)
Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu ; Morris, Robert
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Chromatic thresholds in sparse random graphs. Random Structures & Algorithms, v. 51, n. 2, p. 215–236, 2017Tradução . . Disponível em: https://doi.org/10.1002/rsa.20709. Acesso em: 10 nov. 2025.
APA
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y., & Morris, R. (2017). Chromatic thresholds in sparse random graphs. Random Structures & Algorithms, 51( 2), 215–236. doi:10.1002/rsa.20709
NLM
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in sparse random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 215–236.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1002/rsa.20709
Vancouver
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in sparse random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 215–236.[citado 2025 nov. 10 ] Available from: https://doi.org/10.1002/rsa.20709

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation